Shortest path solves edge-to-edge visibility in a polygon
From MaRDI portal
Publication:3771676
DOI10.1016/0167-8655(86)90015-2zbMath0633.68120OpenAlexW2058872551MaRDI QIDQ3771676
Publication date: 1986
Published in: Pattern Recognition Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8655(86)90015-2
Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (8)
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons ⋮ An O(n log n) algorithm for computing a link center in a simple polygon ⋮ An \(O(n\log n)\) algorithm for computing the link center of a simple polygon ⋮ Computing the full visibility graph of a set of line segments ⋮ Characterizing and recognizing weak visibility polygons ⋮ Tracing compressed curves in triangulated surfaces ⋮ On separating two simple polygons by a single translation ⋮ VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME
This page was built for publication: Shortest path solves edge-to-edge visibility in a polygon