Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons

DOI10.52547/ijmsi.17.2.235OpenAlexW4312340015MaRDI QIDQ5056907

Mohammad Reza Zarrabi, Nasrollah Moghaddam Charkari

Publication date: 8 December 2022

Published in: Iranian Journal of Mathematical Sciences and Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.12778

zbMATH Keywords

point locationminimum link pathshortest path map

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons

Cites Work

• Unnamed Item
• Finding an approximate minimum-link visibility path inside a simple polygon
• Corrections to Lee's visibility polygon algorithm
• Minimum-link paths among obstacles in the plane
• Minimal link visibility paths inside a simple polygon
• A linear time algorithm for minimum link paths inside a simple polygon
• Optimal Point Location in a Monotone Subdivision
• Optimal Shortest Path and Minimum-Link Path Queries between Two Convex Polygons inside a Simple Polygonal Obstacle
• LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON
• Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons
• Computing the visibility polygon from a convex set and related problems

This page was built for publication: Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons