All Farthest Neighbors in the Presence of Highways and Obstacles

DOI10.1007/978-3-642-00202-1_7zbMATH Open1211.68461OpenAlexW1573345056MaRDI QIDQ3605486FDOQ3605486

Matias Korman, Sang Won Bae, Takeshi Tokuyama

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

Recommendations

• Farthest neighbors and center points in the presence of rectangular obstacles
• CONSTRUCTING OPTIMAL HIGHWAYS
• Highway hull revisited
• scientific article; zbMATH DE number 1796963
• Shortest paths in the plane with convex polygonal obstacles

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

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

This page was built for publication: All Farthest Neighbors in the Presence of Highways and Obstacles

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