ON BENDS AND LENGTHS OF RECTILINEAR PATHS: A GRAPH-THEORETIC APPROACH

DOI10.1142/S0218195992000056zbMath0761.68102MaRDI QIDQ4016893

No author found.

Publication date: 16 January 1993

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

shortest pathrectilinear obstaclesminimum bend path

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (9)

Minimum-link shortest paths for polygons amidst rectilinear obstacles ⋮ A connectivity graph generation approach for Manhattan path calculation in detailed facility layout ⋮ Rectilinear paths with minimum segment lengths ⋮ Minimum-link paths revisited ⋮ Proximity problems for points on a rectilinear plane with rectangular obstacles ⋮ An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model ⋮ Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane ⋮ Rectilinear paths among rectilinear obstacles ⋮ Computing Shortest Paths in the Plane with Removable Obstacles

This page was built for publication: ON BENDS AND LENGTHS OF RECTILINEAR PATHS: A GRAPH-THEORETIC APPROACH