The following pages link to Voronoi (Q33596):
Displaying 30 items.
- On the complexity of higher order abstract Voronoi diagrams (Q2354919) (← links)
- Local tensor valuations (Q2362646) (← links)
- Boat-sail Voronoi diagram on a curved surface (Q2388263) (← links)
- Pre-triangulations and liftable complexes (Q2471725) (← links)
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings (Q2482209) (← links)
- General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties (Q2482216) (← links)
- A comparison of sequential Delaunay triangulation algorithms. (Q2482895) (← links)
- Coverage and exposure paths in wireless sensor networks (Q2508398) (← links)
- The geometry of Minkowski spaces -- a survey. II. (Q2571082) (← links)
- Boat-sail Voronoi diagram and its computation based on a cone-approximation scheme (Q2583115) (← links)
- 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001) (Q2777710) (← links)
- On kinetic Delaunay triangulations: a near-quadratic bound for unit speed motions (Q2796411) (← links)
- Counting Plane Graphs: Flippability and Its Applications (Q2847913) (← links)
- Fundamental groups of links of isolated singularities (Q2922788) (← links)
- Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks (Q3223935) (← links)
- PRICING GEOMETRIC TRANSPORTATION NETWORKS (Q3405968) (← links)
- (Q4401010) (← links)
- Computability of Partial Delaunay Triangulation and Voronoi Diagram [Extended Abstract] (Q4916186) (← links)
- Free-form deformation, mesh morphing and reduced-order methods: enablers for efficient aerodynamic shape optimisation (Q5031477) (← links)
- An optimal algorithm for computing visible nearest foreign neighbors among colored line segments (Q5054843) (← links)
- Voronoi Diagrams for Parallel Halflines and Line Segments in Space (Q5136222) (← links)
- (Q5358292) (← links)
- IAN: Iterated Adaptive Neighborhoods for Manifold Learning and Dimensionality Estimation (Q5885248) (← links)
- Triangulations with Circular Arcs (Q5892071) (← links)
- Triangulations with Circular Arcs (Q5895516) (← links)
- Interval arithmetic yields efficient dynamic filters for computational geometry (Q5929320) (← links)
- VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments (Q5943290) (← links)
- Sequences of spanning trees and a fixed tree theorem (Q5959551) (← links)
- Computing Voronoi skeletons of a 3-D polyhedron by space subdivision (Q5959555) (← links)
- Conformal mapping in linear time (Q5962354) (← links)
