Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements
From MaRDI portal
(Redirected from Publication:1317487)
Recommendations
- Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
- A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis
- On higher order Voronoi diagrams of line segments
- On levels in arrangements and Voronoi diagrams
- On the complexity of higher order abstract Voronoi diagrams
- On the complexity of higher order abstract Voronoi diagrams
- Dynamic construction of abstract Voronoi diagrams
- Higher-order Voronoi diagrams on triangulated surfaces
Cites work
- -nets and simplex range queries
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- Applications of random sampling in computational geometry. II
- Edge-skeletons in arrangements with applications
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 177830 (Why is no real title available?)
- scientific article; zbMATH DE number 3482343 (Why is no real title available?)
- Linear Programming in Linear Time When the Dimension Is Fixed
- New applications of random sampling in computational geometry
- On k-Nearest Neighbor Voronoi Diagrams in the Plane
- On levels in arrangements and Voronoi diagrams
- Shellable Decompositions of Cells and Spheres.
- Voronoi diagrams and arrangements
Cited in
(4)
This page was built for publication: Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1317487)