Arrangements on Parametric Surfaces I: General Framework and Infrastructure

We introduce a framework for the construction, maintenance, and manipulation of arrangements of curves embedded on certain two-dimensional orientable parametric surfaces in three-dimensional space. The framework applies to planes, cylinders, spheres, tori, and surfaces homeomorphic to them. We reduce the effort needed to generalize existing algorithms, such as the sweep line and zone traversal algorithms, originally designed for arrangements of bounded curves in the plane, by extensive reuse of code. We have realized our approach as the Cgal package Arrangement_on_surface_2. We define a compact and modular interface for our framework; for a given application a required small subset of the interface can be identified. Then, only this subset must be implemented. A companion paper describes concretizations for several types of surfaces and curves embedded on them, and applications. This is the first implementation of a generic algorithm that can handle arrangements on a large class of parametric surfaces.     

Approximation of Parametric Surfaces

A general method to determine the approximation order of a triangular surface segment with planar boundary curves by a suitable Bézier patch is developed; the method is based on the affine invariance of the approximation order and uses adapted coordinate systems. As an example the case of a quadratic Bézier approximant is worked out in detail and results in the approximation order of three.     

参数曲面的局部凸性条件

参数曲面的凸性分析在计算机辅助设计中有着重要的作用.给出了一般参数曲面局部凸的定义,利用曲面的第二基本量和高斯曲率.得到了一般参数曲面局部凸的几个必要条件.     

Semicontinuity of Solution Sets to Parametric Quasivariational Inclusions with Applications to Traffic Networks II: Lower Semicontinuities Applications

We propose some notions related to semicontinuity of a multivalued mapping and provide a clear insight for various semicontinuity-related definitions. We establish verifiable sufficient conditions for solution sets of general quasivariational inclusion problems to have these semicontinuity-related properties. Our results are proved to include and improve recent ones in the literature by corollaries and examples. Part I is devoted to upper semicontinuity properties of solution sets. Part II discusses lower semicontinuities of these sets and applications, where we discuss in details a traffic network problem as a sample for employing the main results in practical situations     

On Levels in Arrangements of Surfaces in Three Dimensions

A favorite open problem in combinatorial geometry is to determine the worst-case complexity of a level in an arrangement. Up to now, nontrivial upper bounds in three dimensions are known only for the linear cases of planes and triangles. We propose the first technique that can deal with more general surfaces in three dimensions. For example, in an arrangement of n ??pseudo-planes?? or ??pseudo-spherical patches?? (where the main criterion is that each triple of surfaces has at most two common intersections), we prove that there are at most O(n ^2.997) vertices at any given level.     

Online Point Location in Planar Arrangements and Its Applications

Recently, Har-Peled [HP2] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper we present several applications of this technique, which yield improved solutions to a variety of problems. These applications include: (i) an efficient mechanism for performing online point-location queries in an arrangement of arcs; (ii) an efficient algorithm for computing an approximation to the minimum weight Steiner tree of a set of points, where the weight is the number of intersections between the tree edges and a given collection of arcs; (iii) a subquadratic algorithm for cutting a set of pseudo-parabolas into pseudo-segments; (iv) an algorithm for cutting a set of line segments (``rods') in 3-space to eliminate all cycles in the vertical depth order; and (v) a near-optimal algorithm for reporting all bichromatic intersections between a set R of red arcs and a set B of blue arcs, where the unions of the arcs in each set are both connected. Received December 22, 1999, and in revised form August 25, 2000. Online publication May 11, 2001.     

求参数函数置信限的一般性WCF方法及其应用

该文将求参数函数置信下限的WCF方法推广到参数的估计量之间具有相关性的一般情形; 利用推广了的公式, 给出了求单个威布尔型设备及含威布尔型设备的系统可靠度置信下限的方法, 并进行了模拟研究. 模拟结果表明, 该方法优于基于渐近正态性的近似方法, 尤其是在中小样本情况.     

Center conditions II: Parametric and model center problems

We consider an Abel equation (*)y’=p(x)y ² +q(x)y ³ withp(x), q(x) polynomials inx. A center condition for (*) (closely related to the classical center condition for polynomial vector fields on the plane) is thaty ₀=y(0)≡y(1) for any solutiony(x) of (*). We introduce a parametric version of this condition: an equation (**)y’=p(x)y ² +εq(x)y ³ p, q as above, ℂ, is said to have a parametric center, if for any ε and for any solutiony(ε,x) of (**),y(ε,0)≡y(ε,1). We show that the parametric center condition implies vanishing of all the momentsm _k (1), wherem _k (x)=∫ ₀ ^{x pk} (t)q(t)(dt),P(x)=∫ ₀ ^x p(t)dt. We investigate the structure of zeroes ofm _k (x) and on this base prove in some special cases a composition conjecture, stated in [10], for a parametric center problem. The research of the first and the third author was supported by the Israel Science Foundation, Grant No. 101/95-1 and by the Minerva Foundation.     

A Unified Equiaffine Theory for Surfaces in IR4 Part II: Indefinite Surfaces

Results in Mathematics - In this paper we introduce a general equiaffine theory for indefinite surfaces in IR4 with respect to an asymptotic connection. By special choices of asymptotic connections...     

Special Functions on the Sphere with Applications to Minimal Surfaces

A function which is homogeneous in x, y, z of degree n and satisfies V_xx + V_yy + V_zz = 0 is called a spherical harmonic. In polar coordinates, the spherical harmonics take the form rⁿf_n, where f_n is a spherical surface harmonic of degree n. On a sphere, f_n satisfies ▵ f_n + n(n + 1)f_n = 0, where ▵ is the spherical Laplacian. Bounded spherical surface harmonics are well studied, but in certain instances, unbounded spherical surface harmonics may be of interest. For example, if X is a parameterization of a minimal surface and n is the corresponding unit normal, it is known that the support function, w = X · n, satisfies ▵w + 2w = 0 on a branched covering of a sphere with some points removed. While simple in form, the boundary value problem for the support function has a very rich solution set. We illustrate this by using spherical harmonics of degree one to construct a number of classical genus-zero minimal surfaces such as the catenoid, the helicoid, Enneper's surface, and Hennenberg's surface, and Riemann's family of singly periodic genus-one minimal surfaces.     

直纹二次曲面在现实生活中的应用分析

直纹二次曲面中有两种性质独特的曲面:单叶双曲面和双曲抛物面,它们在现实生活中多个领域都有特殊的用途.从理论角度对单叶双曲面和双曲抛物面在建筑、机械以及水利工程中的典型应用给予详细总结和分析,并结合它们自身的数学性质对其实际应用效果给予评析.     

Logarithmic Orbifold Euler Numbers of Surfaces with Applications

We introduce orbifold Euler numbers for normal surfaces withboundary Q-divisors. These numbers behave multiplicatively underfinite maps and in the log canonical case we prove that theysatisfy the Bogomolov–Miyaoka–Yau type inequality.Existence of such a generalization was earlier conjectured byG. Megyesi [Proc. London Math. Soc. (3) 78 (1999) 241–282].Most of the paper is devoted to properties of local orbifoldEuler numbers and to their computation. As a first application we show that our results imply a generalizedversion of R. Holzapfel's ‘proportionality theorem’[Ball and surface arithmetics, Aspects of Mathematics E29 (Vieweg,Braunschweig, 1998)]. Then we show a simple proof of a necessarycondition for the logarithmic comparison theorem which recoversan earlier result by F. Calderón-Moreno, F. Castro-Jiménez,D. Mond and L. Narváez-Macarro [Comment. Math. Helv.77 (2002) 24–38]. Then we prove effective versions of Bogomolov's result on boundednessof rational curves in some surfaces of general type (conjecturedby G. Tian [Springer Lecture Notes in Mathematics 1646 (1996)143–185)]. Finally, we give some applications to singularitiesof plane curves; for example, we improve F. Hirzebruch's boundon the maximal number of cusps of a plane curve. 2000 MathematicalSubject Classification: 14J17, 14J29, 14C17.     

High-Dimensional Adaptive Sparse Polynomial Interpolation and Applications to Parametric PDEs

We consider the problem of Lagrange polynomial interpolation in high or countably infinite dimension, motivated by the fast computation of solutions to partial differential equations (PDEs) depending on a possibly large number of parameters which result from the application of generalised polynomial chaos discretisations to random and stochastic PDEs. In such applications there is a substantial advantage in considering polynomial spaces that are sparse and anisotropic with respect to the different parametric variables. In an adaptive context, the polynomial space is enriched at different stages of the computation. In this paper, we study an interpolation technique in which the sample set is incremented as the polynomial dimension increases, leading therefore to a minimal amount of PDE solving. This construction is based on the standard principle of tensorisation of a one-dimensional interpolation scheme and sparsification. We derive bounds on the Lebesgue constants for this interpolation process in terms of their univariate counterpart. For a class of model elliptic parametric PDE’s, we have shown in Chkifa et al. (Modél. Math. Anal. Numér. 47(1):253–280, 2013) that certain polynomial approximations based on Taylor expansions converge in terms of the polynomial dimension with an algebraic rate that is robust with respect to the parametric dimension. We show that this rate is preserved when using our interpolation algorithm. We also propose a greedy algorithm for the adaptive selection of the polynomial spaces based on our interpolation scheme, and illustrate its performance both on scalar valued functions and on parametric elliptic PDE’s.     

Covering Surfaces with Noncommutative Monodromy Groups and their Industrial Applications

An explicit construction of the algebraic equations of the covering surfaces with the noncommutative monodromy groups is done by means of the corresponding homogeneous vector boundary Riemann-Hilbert problem solution. The direct applications concern soliton theory and Landau-Lifshitz equation, in particular. (© 2012 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences

We give a surprisingly short proof that in any planar arrangement of n curves where each pair intersects at most a fixed number (s) of times, the k-level has subquadratic (O(n^2-1/2s) complexity. This answers one of the main open problems from the author’s previous paper [DCG 29, 375-393 (2003)], which provided a weaker upper bound for a restricted class of curves only (graphs of degree-s polynomials). When combined with existing tools (cutting curves, sampling, etc.), the new idea generates a slew of improved k-level results for most of the curve families studied earlier, including a near-O(n^3/2 bound for parabolas.     

Partitioning arrangements of lines II: Applications

In this paper we present efficient deterministic algorithms for various problems involving lines or segments in the plane, using the partitioning algorithm described in a companion paper [A3]. These applications include: (i) anO(m ^2/3 n ^2/3 · log^2/3 n · log^/3 (m/n)+(m+n) logn) algorithm to compute all incidences betweenm points andn lines, where is a constant <3.33; (ii) anO(m ^2/3 n ^2/3 · log^5/3 n · log^/3 (m/n)+(m+n) logn) algorithm to computem faces in an arrangement ofn lines; (iii) anO(n ^4/3 log^(+2)/3 n) algorithm to count the number of intersections in a set ofn segments; (iv) anO(n ^4/3 log^{( + 2)/3} n) algorithm to count red-blue intersections between two sets of segments, and (v) anO(n ^3/2 log^/3 n) algorithm to compute spanning trees with low stabbing number for a set ofn points. We also present an algorithm that, given set ofn points in the plane, preprocesses it, in timeO(nm log^+1/2 n), into a data structure of sizeO(m) forn lognmn ², so that the number of points ofS lying inside a query triangle can be computed inO((n/m) log^3/2 n) time.Work on this paper has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant DCR-83-20085, and by grants from the Digital Equipment Corporation and the IBM Corporation. A preliminary version of this paper appears in theProceedings of the 5th ACM Symposium on Computational Geometry, 1989, pp. 11–22.