Voronoi
From MaRDI portal
Software:33596
swMATH21795MaRDI QIDQ33596FDOQ33596
Author name not available (Why is that?)
Cited In (80)
- Boat-sail Voronoi diagram and its computation based on a cone-approximation scheme
- On shape Delaunay tessellations
- Pre-triangulations and liftable complexes
- Three-dimensional unstructured gridding for complex wells and geological features in subsurface reservoirs, with CVD-MPFA discretization performance
- IAN: Iterated Adaptive Neighborhoods for Manifold Learning and Dimensionality Estimation
- Voronoi Diagrams for Parallel Halflines and Line Segments in Space
- Triangulations with Circular Arcs
- Boat-sail Voronoi diagram on a curved surface
- Temporally coherent general dynamic scene reconstruction
- Computing the topology of Voronoï diagrams of parallel half-lines
- Robustly computing restricted Voronoi diagrams (RVD) on thin-plate models
- Triangulations with Circular Arcs
- Interior boundary-aligned unstructured grid generation and cell-centered versus vertex-centered CVD-MPFA performance
- Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks
- Computation of spatial skyline points
- The Delaunay triangulation learner and its ensembles
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
- On optimal bridges between two convex regions
- Fundamental groups of links of isolated singularities
- A note on visibility-constrained Voronoi diagrams
- On the complexity of higher order abstract Voronoi diagrams
- On local transformation of polygons with visibility properties.
- Bounds for the CRDT conformal mapping algorithm
- Title not available (Why is that?)
- General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties
- Note on the complexity of the mixed-integer hull of a polyhedron
- Abstract Voronoi diagrams revisited
- Continuous amortization and extensions: with applications to bisection-based root isolation
- The visibility-Voronoi complex and its applications
- A faster circle-sweep Delaunay triangulation algorithm
- Image categorization: Graph edit distance \(+\) edge direction histogram
- Index structures for fast similarity search for real vectors. II
- Numerical investigation of the effect of non-local plasticity on surface roughening in metals
- A control problem for affine dynamical systems on a full-dimensional polytope.
- A lower bound on Voronoi diagram complexity.
- Coverage and exposure paths in wireless sensor networks
- Numerical studies of MacQueen's \(k\)-means algorithm for computing the centroidal Voronoi tessellations
- Interval arithmetic yields efficient dynamic filters for computational geometry
- Stable marker-particle method for the Voronoi diagram in a flow field
- Connecting colored point sets
- Predictive control for hybrid systems. Implications of polyhedral pre-computations
- Higher order Delaunay triangulations
- Sign determination in residue number systems
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)
- Conformal mapping in linear time
- Kernel interpolation
- Computing Voronoi skeletons of a 3-D polyhedron by space subdivision
- Alexandrov's theorem, weighted Delaunay triangulations, and mixed volumes
- Kinetic and dynamic Delaunay tetrahedralizations in three dimensions
- Index structures for fast similarity search for real-valued vectors. I
- A comparison of sequential Delaunay triangulation algorithms.
- Improving continuity of Voronoi-based interpolation over Delaunay spheres
- The Voronoi diagram of three lines
- Towards exact geometric computation
- The geometry of Minkowski spaces -- a survey. II.
- Free-form deformation, mesh morphing and reduced-order methods: enablers for efficient aerodynamic shape optimisation
- Triangulations from topologically correct digital Voronoi diagrams
- A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space
- Dynamics and limiting behavior of Julia sets of König's method for multiple roots
- Grid generation and optimization based on centroidal Voronoi tessellations
- Integer convex minimization by mixed integer linear optimization
- On kinetic Delaunay triangulations: a near-quadratic bound for unit speed motions
- Local tensor valuations
- VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments
- Efficient mesh optimization schemes based on optimal Delaunay triangulations
- Sequences of spanning trees and a fixed tree theorem
- Counting Plane Graphs: Flippability and Its Applications
- Computability of Partial Delaunay Triangulation and Voronoi Diagram [Extended Abstract]
- Witness (Delaunay) graphs
- PRICING GEOMETRIC TRANSPORTATION NETWORKS
- Coloring planar homothets and three-dimensional hypergraphs
- Title not available (Why is that?)
- 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
- Forest-like abstract Voronoi diagrams in linear time
- Simulated evolution of selfish herd behavior
- The number of holes in the union of translates of a convex set in three dimensions
- Constructing a Pareto front approximation for decision making
- Universality theorems for inscribed polytopes and Delaunay triangulations
- Approximating the maxmin-angle covering triangulation
- An optimal algorithm for computing visible nearest foreign neighbors among colored line segments
This page was built for software: Voronoi