Forest-like abstract Voronoi diagrams in linear time
From MaRDI portal
(Redirected from Publication:1699286)
Recommendations
Cites work
- scientific article; zbMATH DE number 732977 (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?)
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- Abstract Voronoi diagrams revisited
- Concrete and abstract Voronoi diagrams
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
- Linear-time algorithms for the farthest-segment Voronoi diagram and related tree structures
- Randomized incremental construction of abstract Voronoi diagrams
- Voronoi diagrams and Delaunay triangulations
Cited in
(7)- Abstract Voronoi-like graphs: extending Delaunay's theorem and applications
- On selecting a fraction of leaves with disjoint neighborhoods in a plane tree
- Deletion in Abstract Voronoi Diagrams in Expected Linear Time.
- Navigating Forest Straight-Line Programs in Constant Time
- scientific article; zbMATH DE number 1555916 (Why is no real title available?)
- Deletion in abstract Voronoi diagrams in expected linear time and related problems
- Linear-time algorithms for the farthest-segment Voronoi diagram and related tree structures
This page was built for publication: Forest-like abstract Voronoi diagrams in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1699286)