Linear-time algorithms for the farthest-segment Voronoi diagram and related tree structures

DOI10.1007/978-3-662-48971-0_35MaRDI QIDQ3459879zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• On the farthest line-segment Voronoi diagram
• On the Farthest Line-Segment Voronoi Diagram
• Farthest line segment Voronoi diagrams
• Forest-like abstract Voronoi diagrams in linear time
• Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments

Cited in

(7)

• Forest-like abstract Voronoi diagrams in linear time
• Rearranging a sequence of points onto a line
• On selecting a fraction of leaves with disjoint neighborhoods in a plane tree
• On the farthest line-segment Voronoi diagram
• A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
• Deletion in Abstract Voronoi Diagrams in Expected Linear Time.
• Farthest line segment Voronoi diagrams

This page was built for publication: Linear-time algorithms for the farthest-segment Voronoi diagram and related tree structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3459879)