Proximity problems for points on a rectilinear plane with rectangular obstacles
From MaRDI portal
Publication:675298
DOI10.1007/BF02523193zbMATH Open0865.68122MaRDI QIDQ675298FDOQ675298
Authors: Juan-Miguel Gracia
Publication date: 30 June 1997
Published in: Algorithmica (Search for Journal in Brave)
Recommendations
Cites Work
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- Title not available (Why is that?)
- Two-Dimensional Voronoi Diagrams in the L p -Metric
- ON BENDS AND LENGTHS OF RECTILINEAR PATHS: A GRAPH-THEORETIC APPROACH
- Optimal Search in Planar Subdivisions
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Finding minimum rectilinear distance paths in the presence of barriers
- On Some Distance Problems in Fixed Orientations
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Finding Minimum Spanning Trees
- On the complexity of computations under varying sets of primitives
- Time Redundant Fault-Location in Bit-Sliced ALU's
- SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Proximity problems for points on a rectilinear plane with rectangular obstacles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675298)