scientific article; zbMATH DE number 177554

MaRDI QIDQ4037425zbMATH OpenFDO

Authors Giri Narasimhan, Gautam K. Das

Publication date 18 May 1993

zbMATH Keywords

breadth first searchintersection graphline segmentsminimum link rectilinear path

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Efficient Algorithms for Geometric Graph Search Problems
• Minimum-link paths among obstacles in the plane
• A nearly optimal algorithm for finding \(L _{1}\) shortest paths among polygonal obstacles in the plane

Cited in

(6)

• An optimal algorithm for the rectilinear link center of a rectilinear polygon
• Settling the bound on the rectilinear link radius of a simple rectilinear polygon
• Minimum-link shortest paths for polygons amidst rectilinear obstacles
• Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane
• Minimum-link paths revisited
• Cutting polygons into small pieces with chords: Laser-based localization

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