# Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons

@article{Zarrabi2020SinglePointVC, title={Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons}, author={Mohammad R. Zarrabi and Nasrollah Moghaddam Charkari}, journal={ArXiv}, year={2020}, volume={abs/2003.12778} }

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… CONTINUE READING

One Citation

Query-points visibility constraint minimum link paths in simple polygons

- Computer Science, Mathematics
- 2020

1

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 12 REFERENCES

Computing the Visibility Polygon from a Convex Set and Related Problems

- Mathematics, Computer Science
- 1991

50

Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon

- Mathematics, Computer Science
- 1995

22