5,543 research outputs found
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
Dimension and Dimensional Reduction in Quantum Gravity
If gravity is asymptotically safe, operators will exhibit anomalous scaling
at the ultraviolet fixed point in a way that makes the theory effectively
two-dimensional. A number of independent lines of evidence, based on different
approaches to quantization, indicate a similar short-distance dimensional
reduction. I will review the evidence for this behavior, emphasizing the
physical question of what one means by `dimension' in a quantum spacetime, and
will discuss possible mechanisms that could explain the universality of this
phenomenon.Comment: For proceedings of the conference in honor of Martin Reuter: "Quantum
Fields---From Fundamental Concepts to Phenomenological Questions"; 14 pages;
based in part on my review article arXiv:1705.0541
Topological Signals of Singularities in Ricci Flow
We implement methods from computational homology to obtain a topological
signal of singularity formation in a selection of geometries evolved
numerically by Ricci flow. Our approach, based on persistent homology, produces
precise, quantitative measures describing the behavior of an entire collection
of data across a discrete sample of times. We analyze the topological signals
of geometric criticality obtained numerically from the application of
persistent homology to models manifesting singularities under Ricci flow. The
results we obtain for these numerical models suggest that the topological
signals distinguish global singularity formation (collapse to a round point)
from local singularity formation (neckpinch). Finally, we discuss the
interpretation and implication of these results and future applications.Comment: 24 pages, 14 figure
Kinetic and Dynamic Delaunay tetrahedralizations in three dimensions
We describe the implementation of algorithms to construct and maintain
three-dimensional dynamic Delaunay triangulations with kinetic vertices using a
three-simplex data structure. The code is capable of constructing the geometric
dual, the Voronoi or Dirichlet tessellation. Initially, a given list of points
is triangulated. Time evolution of the triangulation is not only governed by
kinetic vertices but also by a changing number of vertices. We use
three-dimensional simplex flip algorithms, a stochastic visibility walk
algorithm for point location and in addition, we propose a new simple method of
deleting vertices from an existing three-dimensional Delaunay triangulation
while maintaining the Delaunay property. The dual Dirichlet tessellation can be
used to solve differential equations on an irregular grid, to define partitions
in cell tissue simulations, for collision detection etc.Comment: 29 pg (preprint), 12 figures, 1 table Title changed (mainly
nomenclature), referee suggestions included, typos corrected, bibliography
update
Aspects of Unstructured Grids and Finite-Volume Solvers for the Euler and Navier-Stokes Equations
One of the major achievements in engineering science has been the development of computer algorithms for solving nonlinear differential equations such as the Navier-Stokes equations. In the past, limited computer resources have motivated the development of efficient numerical schemes in computational fluid dynamics (CFD) utilizing structured meshes. The use of structured meshes greatly simplifies the implementation of CFD algorithms on conventional computers. Unstructured grids on the other hand offer an alternative to modeling complex geometries. Unstructured meshes have irregular connectivity and usually contain combinations of triangles, quadrilaterals, tetrahedra, and hexahedra. The generation and use of unstructured grids poses new challenges in CFD. The purpose of this note is to present recent developments in the unstructured grid generation and flow solution technology
- …