Rectilinear Path Problems among Rectilinear Obstacles Revisited

DOI10.1137/S0097539792229672zbMath0831.68110OpenAlexW2051045196MaRDI QIDQ4842114

No author found.

Publication date: 26 July 1995

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539792229672

zbMATH Keywords

minimum-bend pathpath preserving graphrectilinear collision-free paths

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (12)

Minimum-link shortest paths for polygons amidst rectilinear obstacles ⋮ Computation of arc length in the presence of barriers in networks ⋮ Shortest paths among transient obstacles ⋮ Finding shortest path in the presence of barriers: an alternate approach ⋮ On geometric path query problems ⋮ Minimum-link paths revisited ⋮ Finding rectilinear least cost paths in the presence of convex polygonal congested regions ⋮ An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model ⋮ ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS ⋮ 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: Rectilinear Path Problems among Rectilinear Obstacles Revisited