Efficient computation of rectilinear geodesic Voronoi neighbor in presence of obstacles

DOI10.1007/3-540-62034-6_39zbMATH Open1541.68407MaRDI QIDQ6567758FDOQ6567758

Authors: Pinaki Mitra, Subhas C. Nandy 

Publication date: 5 July 2024

Recommendations

• Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in the Presence of Obstacles
• Proximity problems for points on a rectilinear plane with rectangular obstacles
• Farthest-point Voronoi diagrams in the presence of rectangular obstacles
• Farthest neighbors and center points in the presence of rectangular obstacles
• Rectilinear short path queries among rectangular 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
• Title not available (Why is that?)
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Optimal Search in Planar Subdivisions
• A faster approximation algorithm for the Steiner problem in graphs
• Rectilinear shortest paths in the presence of rectangular barriers

Cited In (1)

• Farthest-point Voronoi diagrams in the presence of rectangular obstacles

This page was built for publication: Efficient computation of rectilinear geodesic Voronoi neighbor in presence of obstacles

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