Forest-like abstract Voronoi diagrams in linear time
DOI10.1016/J.COMGEO.2017.06.013zbMATH Open1396.65034OpenAlexW2728819971MaRDI QIDQ1699286FDOQ1699286
Authors: Cecilia Bohler, Rolf Klein, Andrzej Lingas, Chih-Hung Liu 
Publication date: 19 February 2018
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2017.06.013
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Buildings and the geometry of diagrams (51E24)
Cites Work
- Title not available (Why is that?)
- Concrete and abstract Voronoi diagrams
- Voronoi diagrams and Delaunay triangulations
- Title not available (Why is that?)
- Abstract Voronoi diagrams revisited
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- Title not available (Why is that?)
- Randomized incremental construction of abstract Voronoi diagrams
- Linear-time algorithms for the farthest-segment Voronoi diagram and related tree structures
- Title not available (Why is that?)
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
Cited In (7)
- Deletion in Abstract Voronoi Diagrams in Expected Linear Time.
- Deletion in abstract Voronoi diagrams in expected linear time and related problems
- Abstract Voronoi-like graphs: extending Delaunay's theorem and applications
- On selecting a fraction of leaves with disjoint neighborhoods in a plane tree
- Navigating Forest Straight-Line Programs in Constant Time
- Title not available (Why is that?)
- Linear-time algorithms for the farthest-segment Voronoi diagram and related tree structures
Uses Software
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)
