Abstract Voronoi diagrams revisited
From MaRDI portal
Publication:833716
DOI10.1016/J.COMGEO.2009.03.002zbMATH Open1173.65014OpenAlexW2015545367MaRDI QIDQ833716FDOQ833716
Authors: Rolf Klein, Elmar Langetepe, Zahra Nilforoushan
Publication date: 14 August 2009
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.03.002
Recommendations
Cites Work
- Title not available (Why is that?)
- Convex and Discrete Geometry
- Title not available (Why is that?)
- Voronoi diagrams and arrangements
- Concrete and abstract Voronoi diagrams
- Quickest paths, straight skeletons, and the city Voronoi diagram
- Applications of random sampling in computational geometry. II
- FURTHEST SITE ABSTRACT VORONOI DIAGRAMS
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- On the computational geometry of pocket machining
- Title not available (Why is that?)
- Randomized incremental construction of abstract Voronoi diagrams
- On the construction of abstract Voronoi diagrams
- Title not available (Why is that?)
- Curved Voronoi diagrams
- Abstract Voronoi diagram in 3-space
- Title not available (Why is that?)
- GEOMETRY OF BISECTORS FOR STRICTLY CONVEX DISTANCES
- Dynamic construction of abstract Voronoi diagrams
- Title not available (Why is that?)
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- The Voronoi diagram of planar convex objects
- Casting a polyhedron with directional uncertainty
- Title not available (Why is that?)
- VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE
- The converse of the Jordan curve theorem and a characterization of planar maps
Cited In (27)
- The higher-order Voronoi diagram of line segments
- Non-centered Voronoi Skeletons
- On the complexity of higher order abstract Voronoi diagrams
- Deletion in Abstract Voronoi Diagrams in Expected Linear Time.
- On Birkhoff orthogonality and isosceles orthogonality in normed linear spaces
- Extended box clustering for classification problems
- ABSTRACT VORONOI DIAGRAMS WITH DISCONNECTED REGIONS
- Deletion in abstract Voronoi diagrams in expected linear time and related problems
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams
- An approximation algorithm for computing shortest paths in weighted 3-d domains
- Higher Order Voronoi Diagrams and Distance Functions in Art and Visualization
- A fast algorithm for data collection along a fixed track
- Abstract Voronoi Diagrams from Closed Bisecting Curves
- Computing the map of geometric minimal cuts
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
- A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams
- Link distance and shortest path problems in the plane
- Incremental Voronoi diagrams
- Title not available (Why is that?)
- Title not available (Why is that?)
- Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time
- Forest-like abstract Voronoi diagrams in linear time
- Title not available (Why is that?)
- Title not available (Why is that?)
- The L∞ Hausdorff Voronoi Diagram Revisited
- On the complexity of randomly weighted multiplicative Voronoi diagrams
- Characterization of contour elements that generate abstract Voronoi diagrams
Uses Software
This page was built for publication: Abstract Voronoi diagrams revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833716)