Cited in
(only showing first 100 items - show all)- Computability of partial Delaunay triangulation and Voronoi diagram (extended abstract)
- Abstract Voronoi diagrams revisited
- Numerical studies of MacQueen's \(k\)-means algorithm for computing the centroidal Voronoi tessellations
- scientific article; zbMATH DE number 6776481 (Why is no real title available?)
- Improving continuity of Voronoi-based interpolation over Delaunay spheres
- Alexandrov's theorem, weighted Delaunay triangulations, and mixed volumes
- Kinetic and dynamic Delaunay tetrahedralizations in three dimensions
- On the complexity of higher order abstract Voronoi diagrams
- Sequences of spanning trees and a fixed tree theorem
- Computation of spatial skyline points
- The Delaunay triangulation learner and its ensembles
- Continuous amortization and extensions: with applications to bisection-based root isolation
- Grid generation and optimization based on centroidal Voronoi tessellations
- Index structures for fast similarity search for real-valued vectors. I
- The geometry of Minkowski spaces -- a survey. II.
- A faster circle-sweep Delaunay triangulation algorithm
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
- Conformal mapping in linear time
- Free-form deformation, mesh morphing and reduced-order methods: enablers for efficient aerodynamic shape optimisation
- The visibility-Voronoi complex and its applications
- Stable marker-particle method for the Voronoi diagram in a flow field
- Approximating the maxmin-angle covering triangulation
- Image categorization: Graph edit distance \(+\) edge direction histogram
- Coloring planar homothets and three-dimensional hypergraphs
- Index structures for fast similarity search for real vectors. II
- On kinetic Delaunay triangulations: a near-quadratic bound for unit speed motions
- Universality theorems for inscribed polytopes and Delaunay triangulations
- GDToolkit
- Qhull
- Algorithm 785
- VRONI
- SqFreeEVAL
- A control problem for affine dynamical systems on a full-dimensional polytope.
- CirclePack
- FindSteinerTree
- Triangle
- FIST
- CHomP
- PolyLib
- 2D triangulations
- Hull
- QMG
- IMAGINARY
- FLANN
- QuickHull3D
- A comparison of sequential Delaunay triangulation algorithms.
- largeVis
- SUGGAR++
- FSInteract
- A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space
- Cocone
- CompuTop
- DGD gallery
- Detri
- GEOMETRICA
- GeoCalcLib
- Glop
- IJK
- Powercrust
- Polyominoes
- Trelis
- VaryLab
- VisPak
- SegMatch
- Axl
- Pareto navigator
- LargeVis
- General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties
- scientific article; zbMATH DE number 1182913 (Why is no real title available?)
- Numerical investigation of the effect of non-local plasticity on surface roughening in metals
- Constructing a Pareto front approximation for decision making
- Towards exact geometric computation
- A lower bound on Voronoi diagram complexity.
- Interval arithmetic yields efficient dynamic filters for computational geometry
- Simulated evolution of selfish herd behavior
- The number of holes in the union of translates of a convex set in three dimensions
- Efficient mesh optimization schemes based on optimal Delaunay triangulations
- A note on visibility-constrained Voronoi diagrams
- Fundamental groups of links of isolated singularities
- Witness (Delaunay) graphs
- Local tensor valuations
- Higher order Delaunay triangulations
- Note on the complexity of the mixed-integer hull of a polyhedron
- Coverage and exposure paths in wireless sensor networks
- Sign determination in residue number systems
- Pricing geometric transportation networks
- VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments
- Predictive control for hybrid systems. Implications of polyhedral pre-computations
- Boat-sail Voronoi diagram and its computation based on a cone-approximation scheme
- IAN: Iterated Adaptive Neighborhoods for Manifold Learning and Dimensionality Estimation
- Computing the topology of Voronoï diagrams of parallel half-lines
- On local transformation of polygons with visibility properties.
- Pre-triangulations and liftable complexes
- Triangulations from topologically correct digital Voronoi diagrams
- 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
- Robustly computing restricted Voronoi diagrams (RVD) on thin-plate models
- Temporally coherent general dynamic scene reconstruction
- Triangulations with Circular Arcs
- The Voronoi diagram of three lines
- Triangulations with Circular Arcs
This page was built for software: Voronoi
