scientific article; zbMATH DE number 512835

MaRDI QIDQ4281528zbMATH OpenFDO

Authors Sven Schuierer

Publication date 7 April 1994

zbMATH Keywords

\(L_ 1\) metricdata structurequery timerectilinear link metricrectilinear polygonshortest pathVLSI-design

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON
• On rectilinear link distance
• Rectilinear short path queries among rectangular obstacles
• \(L_{1}\) shortest path queries in simple polygons

Cited in

(12)

• A new data structure for shortest path queries in a simple polygon
• Rectilinear short path queries among rectangular obstacles
• Optimal parallel algorithms for rectilinear link-distance problems
• \(L_{1}\) shortest path queries in simple polygons
• Shortest Path Queries in Polygonal Domains
• SHORTEST PATH QUERIES IN RECTILINEAR WORLDS
• LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON
• AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON
• Efficient approximate shortest-path queries among isothetic rectangular obstacles
• Shortest rectilinear path queries to rectangles in a rectangular domain
• Efficient algorithms for shortest distance queries on special classes of polygons
• On rectilinear link distance

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 Q4281528)