scientific article; zbMATH DE number 3845073

MaRDI QIDQ3315015zbMATH OpenFDO

Authors

Publication date 1982

zbMATH Keywords

algorithmEuclidean shortest pathparallel rectilinear barriersplanar subdivisionplane-sweep techniquepolygonal chain

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Recommendations

• Euclidean shortest paths in the presence of rectilinear barriers
• Rectilinear shortest paths in the presence of rectangular barriers
• Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)
• Parallel rectilinear shortest paths with rectangular obstacles
• SHORTEST PATHS AMONG OBSTACLES IN THE PLANE

Cited in

(7)

• Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)
• Rectilinear shortest paths in the presence of rectangular barriers
• Computation of arc length in the presence of barriers in networks
• Euclidean shortest paths in the presence of rectilinear barriers
• Euclidean shortest path in the presence of obstacles
• ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES
• Finding shortest path in the presence of barriers: an alternate approach

This page was built for publication:

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