The following pages link to Voronoi diagrams and arrangements (Q1079823):
Displayed 50 items.
- Witness (Delaunay) graphs (Q551502) (← links)
- Perturbations for Delaunay and weighted Delaunay 3D triangulations (Q617544) (← links)
- Arrangements on parametric surfaces. I: General framework and infrastructure (Q626974) (← links)
- Arrangements on parametric surfaces. II: Concretizations and applications (Q626976) (← links)
- Range minima queries with respect to a random permutation, and approximate range counting (Q629829) (← links)
- A generic topology library (Q632812) (← links)
- The overlay of minimization diagrams in a randomized incremental construction (Q633216) (← links)
- Efficient mesh optimization schemes based on optimal Delaunay triangulations (Q646311) (← links)
- A parallel algorithm based on convexity for the computing of Delaunay tessellation (Q664607) (← links)
- Piecewise linear interpolants to Lagrange and Hermite convex scattered data (Q676935) (← links)
- Randomized incremental construction of abstract Voronoi diagrams (Q685599) (← links)
- Algorithms for weak and wide separation of sets (Q686422) (← links)
- Construction of Voronoi diagrams in the plane by using maps (Q751861) (← links)
- On the construction of abstract Voronoi diagrams (Q757052) (← links)
- Toughness and Delaunay triangulations (Q803161) (← links)
- Higher-dimensional Voronoi diagrams in linear expected time (Q804320) (← links)
- On levels in arrangements and Voronoi diagrams (Q804321) (← links)
- Abstract Voronoi diagrams revisited (Q833716) (← links)
- Finding nearest neighbors with Voronoi tessellations (Q910225) (← links)
- On overlays and minimization diagrams (Q1014331) (← links)
- Ready, set, go! The Voronoi diagram of moving points that start from a line (Q1029088) (← links)
- Finding extreme points in three dimensions and solving the post-office problem in the plane (Q1069424) (← links)
- Computing circular separability (Q1079817) (← links)
- Edge-skeletons in arrangements with applications (Q1091825) (← links)
- Computing the volume of the union of spheres (Q1104079) (← links)
- On the geodesic Voronoi diagram of point sites in a simple polygon (Q1115602) (← links)
- An upper bound on the shortness exponent of inscribable polytopes (Q1122592) (← links)
- Constructing the relative neighborhood graph in 3-dimensional Euclidean space (Q1175789) (← links)
- An axiomatic approach to Voronoi-diagrams in 3D (Q1176108) (← links)
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions (Q1194310) (← links)
- Convexity preserving interpolation and Powell-Sabin elements (Q1200984) (← links)
- The upper envelope of Voronoi surfaces and its applications (Q1207797) (← links)
- An optimal convex hull algorithm in any fixed dimension (Q1312190) (← links)
- Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements (Q1317487) (← links)
- Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\) (Q1334932) (← links)
- Almost tight upper bounds for lower envelopes in higher dimensions (Q1338960) (← links)
- Randomized incremental construction of simple abstract Voronoi diagrams in 3-space (Q1370927) (← links)
- Triangulations in CGAL (Q1602941) (← links)
- New applications of random sampling in computational geometry (Q1820582) (← links)
- A lower bound on Voronoi diagram complexity. (Q1853066) (← links)
- Abstract Voronoi diagram in 3-space (Q1878678) (← links)
- On-line construction of the upper envelope of triangles and surface patches in three dimensions (Q1917040) (← links)
- On Delaunay oriented matroids for convex distance functions (Q1923774) (← links)
- Three-dimensional convex hull as a fruitful source of diagrams (Q1978717) (← links)
- ``The big sweep'': On the power of the wavefront approach to Voronoi diagrams (Q2365174) (← links)
- General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties (Q2482216) (← links)
- A comparison of sequential Delaunay triangulation algorithms. (Q2482895) (← links)
- On the two-dimensional Davenport-Schinzel problem (Q2638785) (← links)
- Tetrahedrizing point sets in three dimensions (Q2638826) (← links)
- Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance (Q3511346) (← links)