Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons

03/28/2020
by   Mohammad Reza Zarrabi, et al.
0

We address the following problem: Given a simple polygon P with n vertices and two points s and t inside it, find a minimum link path between them such that a given target point q is visible from at least one point on the path. The method is based on partitioning a portion of P into a number of faces of equal link distance from a source point. This partitioning is essentially a shortest path map (SPM). In this paper, we present an optimal algorithm with O(n) time bound, which is the same as the time complexity of the standard minimum link paths problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/05/2020

Query-points visibility constraint minimum link paths in simple polygons

We study the query version of constrained minimum link paths between two...
research
07/14/2020

On approximations to minimum link visibility paths in simple polygons

We investigate a practical variant of the well-known polygonal visibilit...
research
04/05/2020

A simple proof for visibility paths in simple polygons

The purpose of this note is to give a simple proof for a necessary and s...
research
02/18/2019

Geometric secluded paths and planar satisfiability

We consider paths with low "exposure" to a polygonal domain, i.e., paths...
research
01/08/2013

Apollonian Circumcircles of IFS Fractals

Euclidean triangles and IFS fractals seem to be disparate geometrical co...
research
09/13/2023

OrdinalFix: Fixing Compilation Errors via Shortest-Path CFL Reachability

The development of correct and efficient software can be hindered by com...
research
12/31/2018

A shortest-path based clustering algorithm for joint human-machine analysis of complex datasets

Clustering is a technique for the analysis of datasets obtained by empir...

Please sign up or login with your details

Forgot password? Click here to reset