𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Note on Computing the Visibility Polygon from a Convex Chain

✍ Scribed by Subir Kumar Ghosh

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
104 KB
Volume
21
Category
Article
ISSN
0196-6774

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

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

A Note on the Computation of Orbits.
A Note on the Computation of Orbits.
✍ P. Herget πŸ“‚ Article πŸ“… 1934 πŸ› John Wiley and Sons 🌐 English βš– 117 KB πŸ‘ 2 views
A Note on the Unified Coordinate System
A Note on the Unified Coordinate System for Computing Shock Waves
✍ Zi-Niu Wu πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 87 KB

In 1999 [J. Comput. Phys. 153, 596], Hui and his co-workers proposed a unified coordinate system for computing compressible flows with discontinuous solutions. In their coordinate system, there is a free parameter h such that the traditional Eulerian approach and Lagrangian approach correspond to th