All Farthest Neighbors in the Presence of Highways and Obstacles

DOI10.1007/978-3-642-00202-1_7zbMath1211.68461OpenAlexW1573345056MaRDI QIDQ3605486

Sang Won Bae, Takeshi Tokuyama, Matias Korman

Publication date: 24 February 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-00202-1_7

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Locating a single facility and a high-speed line, Locating a Service Facility and a Rapid Transit Line, The 1-Center and 1-Highway Problem, Group nearest-neighbor queries in the \(L_1\) plane, The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited, The 1-median and 1-highway problem

Cites Work

• The transportation metric and related problems
• \(L_ 1\) shortest paths among polygonal obstacles in the plane
• On range searching with semialgebraic sets
• Quickest paths, straight skeletons, and the city Voronoi diagram
• Applications of random sampling in computational geometry. II
• CONSTRUCTING OPTIMAL HIGHWAYS
• Farthest neighbors and center points in the presence of rectngular obstacles
• Optimal Construction of the City Voronoi Diagram
• SHORTEST PATHS AMONG OBSTACLES IN THE PLANE