Proximity problems for points on a rectilinear plane with rectangular obstacles
From MaRDI portal
Publication:675298
DOI10.1007/BF02523193zbMath0865.68122MaRDI QIDQ675298
Publication date: 30 June 1997
Published in: Algorithmica (Search for Journal in Brave)
Related Items (2)
Finding rectilinear least cost paths in the presence of convex polygonal congested regions ⋮ A SHORTEST PAIR OF PATHS ON THE PLANE WITH OBSTACLES AND CROSSING AREAS
Cites Work
- Unnamed Item
- Unnamed Item
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- On the geodesic Voronoi diagram of point sites in a simple polygon
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- On the complexity of computations under varying sets of primitives
- On Some Distance Problems in Fixed Orientations
- Time Redundant Fault-Location in Bit-Sliced ALU's
- Two-Dimensional Voronoi Diagrams in the L p -Metric
- Finding minimum rectilinear distance paths in the presence of barriers
- Optimal Search in Planar Subdivisions
- SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
- ON BENDS AND LENGTHS OF RECTILINEAR PATHS: A GRAPH-THEORETIC APPROACH
- Finding Minimum Spanning Trees
This page was built for publication: Proximity problems for points on a rectilinear plane with rectangular obstacles
