Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks

DOI10.1007/978-3-642-25249-5_9zbMath1250.68273arXiv1005.1053OpenAlexW2402695126MaRDI QIDQ3223935

Thomas Dickerson, Ying Daisy Zhuo, Matthew T. Dickerson, Michael T. Goodrich

Publication date: 9 March 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1005.1053

zbMATH Keywords

Voronoi diagramsroad networksround-trippoint-of-interesttwo-color

Mathematics Subject Classification ID

Applications of graph theory (05C90) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distance in graphs (05C12)

Uses Software

• Voronoi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Voronoi diagram for services neighboring a highway
• Quickest paths, straight skeletons, and the city Voronoi diagram
• 2-point site Voronoi diagrams
• An Improved Algorithm for Constructing kth-Order Voronoi Diagrams
• On k-Nearest Neighbor Voronoi Diagrams in the Plane
• Algorithms and Computation
• Algorithms and Computation
• A faster approximation algorithm for the Steiner problem in graphs

This page was built for publication: Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks