Proximity problems for points on a rectilinear plane with rectangular obstacles
From MaRDI portal
(Redirected from Publication:675298)
Recommendations
Cites work
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 3569833 (Why is no real title available?)
- Finding Minimum Spanning Trees
- Finding minimum rectilinear distance paths in the presence of barriers
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- ON BENDS AND LENGTHS OF RECTILINEAR PATHS: A GRAPH-THEORETIC APPROACH
- On Some Distance Problems in Fixed Orientations
- On the complexity of computations under varying sets of primitives
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Optimal Search in Planar Subdivisions
- SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
- Time Redundant Fault-Location in Bit-Sliced ALU's
- Two-Dimensional Voronoi Diagrams in the L p -Metric
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
Cited in
(5)- 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
- Farthest neighbors and center points in the presence of rectangular obstacles
- Efficient computation of rectilinear geodesic Voronoi neighbor in presence of obstacles
- Geometric applications of posets
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)
