๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Visibility of a simple polygon

โœ Scribed by D.T Lee

Publisher
Elsevier Science
Year
1983
Weight
850 KB
Volume
22
Category
Article
ISSN
0734-189X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimally Computing the Shortest Weakly
Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
โœ Danny Z. Chen ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 209 KB

Given an n-vertex simple polygon P, the problem of computing the shortest weakly visible subedge of P is that of finding a shortest line segment s on the ลฝ . boundary of P such that P is weakly visible from s if s exists . In this paper, we present new geometric observations that are useful for solv