𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on the combinatorial structure of the visibility graph in simple polygons

✍ Scribed by L. Prasad; S.S. Iyengar

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
954 KB
Volume
140
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on the girth-doubling constructio
A note on the girth-doubling construction for polygonal graphs
✍ Ákos Seress; Eric Swartz πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 111 KB πŸ‘ 1 views

A near-polygonal graph is a graph which has a set C of m-cycles for some positive integer m such that each 2-path of is contained in exactly one cycle in C. If m is the girth of then the graph is called polygonal. Given a polygonal graph of valency r and girth m, Archdeacon and Perkel proved the exi

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