scientific article; zbMATH DE number 177558

MaRDI QIDQ4037429zbMATH OpenFDO

Authors

Publication date 18 May 1993

zbMATH Keywords

least-cost pathminimum bend shortest pathpath-preserving graphshortest minimum bend pathtrans-dichotomous algorithm

Mathematics Subject Classification ID

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

Recommendations

• ON BENDS AND LENGTHS OF RECTILINEAR PATHS: A GRAPH-THEORETIC APPROACH
• Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model
• Rectilinear Path Problems among Rectilinear Obstacles Revisited
• Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane
• On bends and distances of paths among obstacles in two-layer interconnection model

Cited in

(8)

• Rectilinear paths with minimum segment lengths
• Approximating minimum bending energy path in a simple corridor
• ON BENDS AND LENGTHS OF RECTILINEAR PATHS: A GRAPH-THEORETIC APPROACH
• Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model
• On bends and distances of paths among obstacles in two-layer interconnection model
• ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS
• Rectilinear Path Problems among Rectilinear Obstacles Revisited
• Finding rectilinear least cost paths in the presence of convex polygonal congested regions

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