Minimal link visibility paths inside a simple polygon

DOI10.1016/0925-7721(93)90027-4zbMath0789.68138OpenAlexW1989185470MaRDI QIDQ2367125

Yanyan Li

Publication date: 23 August 1993

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(93)90027-4

zbMATH Keywords

visibilitycomputational geometry\(NP\)-hard

Mathematics Subject Classification ID

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

Related Items (5)

Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons ⋮ Finding a shortest Hamiltonian path inside a simple polygon ⋮ Finding an approximate minimum-link visibility path inside a simple polygon ⋮ Minimum-link watchman tours ⋮ MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS

Cites Work

• Unnamed Item
• Unnamed Item
• Shortest watchman routes in simple polygons
• Computing the link center of a simple polygon
• Optimum watchman routes
• An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
• A linear time algorithm for minimum link paths inside a simple polygon
• On the Complexity of Some Common Geometric Location Problems
• Euclidean shortest paths in the presence of rectilinear barriers
• Computational complexity of art gallery problems
• A linear algorithm for computing the visibility polygon from a point
• An Optimal Algorithm for Finding the Kernel of a Polygon

This page was built for publication: Minimal link visibility paths inside a simple polygon