Abstract Voronoi diagrams revisited
From MaRDI portal
Publication:833716
Recommendations
Cites work
- scientific article; zbMATH DE number 4110186 (Why is no real title available?)
- scientific article; zbMATH DE number 3497031 (Why is no real title available?)
- scientific article; zbMATH DE number 1182913 (Why is no real title available?)
- scientific article; zbMATH DE number 1455125 (Why is no real title available?)
- scientific article; zbMATH DE number 1555916 (Why is no real title available?)
- scientific article; zbMATH DE number 219277 (Why is no real title available?)
- scientific article; zbMATH DE number 1424293 (Why is no real title available?)
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- Abstract Voronoi diagram in 3-space
- Applications of random sampling in computational geometry. II
- Casting a polyhedron with directional uncertainty
- Concrete and abstract Voronoi diagrams
- Convex and Discrete Geometry
- Curved Voronoi diagrams
- Dynamic construction of abstract Voronoi diagrams
- FURTHEST SITE ABSTRACT VORONOI DIAGRAMS
- GEOMETRY OF BISECTORS FOR STRICTLY CONVEX DISTANCES
- On the computational geometry of pocket machining
- On the construction of abstract Voronoi diagrams
- Quickest paths, straight skeletons, and the city Voronoi diagram
- Randomized incremental construction of abstract Voronoi diagrams
- The Voronoi diagram of planar convex objects
- The converse of the Jordan curve theorem and a characterization of planar maps
- VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE
- Voronoi diagrams and arrangements
Cited in
(28)- Abstract Voronoi-like graphs: extending Delaunay's theorem and applications
- On Birkhoff orthogonality and isosceles orthogonality in normed linear spaces
- scientific article; zbMATH DE number 6487873 (Why is no real title available?)
- On the complexity of higher order abstract Voronoi diagrams
- scientific article; zbMATH DE number 4110186 (Why is no real title available?)
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams
- On the complexity of randomly weighted multiplicative Voronoi diagrams
- Deletion in Abstract Voronoi Diagrams in Expected Linear Time.
- Abstract Voronoi diagrams from closed bisecting curves
- Incremental Voronoi diagrams
- An approximation algorithm for computing shortest paths in weighted 3-d domains
- Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
- Characterization of contour elements that generate abstract Voronoi diagrams
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
- A fast algorithm for data collection along a fixed track
- Abstract Voronoi diagrams with disconnected regions
- Forest-like abstract Voronoi diagrams in linear time
- Extended box clustering for classification problems
- The L∞ Hausdorff Voronoi Diagram Revisited
- Deletion in abstract Voronoi diagrams in expected linear time and related problems
- Higher Order Voronoi Diagrams and Distance Functions in Art and Visualization
- The higher-order Voronoi diagram of line segments
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
- Link distance and shortest path problems in the plane
- scientific article; zbMATH DE number 403949 (Why is no real title available?)
- Computing the map of geometric minimal cuts
- Non-centered Voronoi skeletons
- scientific article; zbMATH DE number 219277 (Why is no real title available?)
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)