All Farthest Neighbors in the Presence of Highways and Obstacles

DOI10.1007/978-3-642-00202-1_7MaRDI QIDQ3605486zbMATH OpenOpenAlexFDO

Authors 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)

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

Cites work

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

Cited in

(6)

• Locating a service facility and a rapid transit line
• The 1-center and 1-highway problem
• 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
• Locating a single facility and a high-speed line

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)