3,324 research outputs found
On the number of higher order Delaunay triangulations
"Vegeu el resum a l'inici del document del fitxer adjunt"
Dense point sets have sparse Delaunay triangulations
The spread of a finite set of points is the ratio between the longest and
shortest pairwise distances. We prove that the Delaunay triangulation of any
set of n points in R^3 with spread D has complexity O(D^3). This bound is tight
in the worst case for all D = O(sqrt{n}). In particular, the Delaunay
triangulation of any dense point set has linear complexity. We also generalize
this upper bound to regular triangulations of k-ply systems of balls, unions of
several dense point sets, and uniform samples of smooth surfaces. On the other
hand, for any n and D=O(n), we construct a regular triangulation of complexity
Omega(nD) whose n vertices have spread D.Comment: 31 pages, 11 figures. Full version of SODA 2002 paper. Also available
at http://www.cs.uiuc.edu/~jeffe/pubs/screw.htm
On Monotone Sequences of Directed Flips, Triangulations of Polyhedra, and Structural Properties of a Directed Flip Graph
This paper studied the geometric and combinatorial aspects of the classical
Lawson's flip algorithm in 1972. Let A be a finite set of points in R2, omega
be a height function which lifts the vertices of A into R3. Every flip in
triangulations of A can be associated with a direction. We first established a
relatively obvious relation between monotone sequences of directed flips
between triangulations of A and triangulations of the lifted point set of A in
R3. We then studied the structural properties of a directed flip graph (a
poset) on the set of all triangulations of A. We proved several general
properties of this poset which clearly explain when Lawson's algorithm works
and why it may fail in general. We further characterised the triangulations
which cause failure of Lawson's algorithm, and showed that they must contain
redundant interior vertices which are not removable by directed flips. A
special case if this result in 3d has been shown by B.Joe in 1989. As an
application, we described a simple algorithm to triangulate a special class of
3d non-convex polyhedra. We proved sufficient conditions for the termination of
this algorithm and show that it runs in O(n3) time.Comment: 40 pages, 35 figure
Neighborly inscribed polytopes and Delaunay triangulations
We construct a large family of neighborly polytopes that can be realized with
all the vertices on the boundary of any smooth strictly convex body. In
particular, we show that there are superexponentially many combinatorially
distinct neighborly polytopes that admit realizations inscribed on the sphere.
These are the first examples of inscribable neighborly polytopes that are not
cyclic polytopes, and provide the current best lower bound for the number of
combinatorial types of inscribable polytopes (which coincides with the current
best lower bound for the number of combinatorial types of polytopes). Via
stereographic projections, this translates into a superexponential lower bound
for the number of combinatorial types of (neighborly) Delaunay triangulations.Comment: 15 pages, 2 figures. We extended our results to arbitrary smooth
strictly convex bodie
Universality theorems for inscribed polytopes and Delaunay triangulations
We prove that every primary basic semialgebraic set is homotopy equivalent to
the set of inscribed realizations (up to M\"obius transformation) of a
polytope. If the semialgebraic set is moreover open, then, in addition, we
prove that (up to homotopy) it is a retract of the realization space of some
inscribed neighborly (and simplicial) polytope. We also show that all algebraic
extensions of are needed to coordinatize inscribed polytopes.
These statements show that inscribed polytopes exhibit the Mn\"ev universality
phenomenon.
Via stereographic projections, these theorems have a direct translation to
universality theorems for Delaunay subdivisions. In particular, our results
imply that the realizability problem for Delaunay triangulations is
polynomially equivalent to the existential theory of the reals.Comment: 15 pages, 2 figure
The Harris-Luck criterion for random lattices
The Harris-Luck criterion judges the relevance of (potentially) spatially
correlated, quenched disorder induced by, e.g., random bonds, randomly diluted
sites or a quasi-periodicity of the lattice, for altering the critical behavior
of a coupled matter system. We investigate the applicability of this type of
criterion to the case of spin variables coupled to random lattices. Their
aptitude to alter critical behavior depends on the degree of spatial
correlations present, which is quantified by a wandering exponent. We consider
the cases of Poissonian random graphs resulting from the Voronoi-Delaunay
construction and of planar, ``fat'' Feynman diagrams and precisely
determine their wandering exponents. The resulting predictions are compared to
various exact and numerical results for the Potts model coupled to these
quenched ensembles of random graphs.Comment: 13 pages, 9 figures, 2 tables, REVTeX 4. Version as published, one
figure added for clarification, minor re-wordings and typo cleanu
- …