Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures

DOI10.1007/978-3-662-48971-0_35zbMath1472.68206OpenAlexW1545503206MaRDI QIDQ3459879

Elena Khramtcova, Evanthia Papadopoulou

Publication date: 11 January 2016

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48971-0_35

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Rearranging a sequence of points onto a line ⋮ A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams ⋮ Forest-like abstract Voronoi diagrams in linear time ⋮ Deletion in Abstract Voronoi Diagrams in Expected Linear Time.

This page was built for publication: Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures