𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Ray shooting in polygons using geodesic triangulations

✍ Scribed by B. Chazelle; H. Edelsbrunner; M. Grigni; L. Guibas; J. Hershberger; M. Sharir; J. Snoeyink

Publisher
Springer
Year
1994
Tongue
English
Weight
914 KB
Volume
12
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Dynamic Ray Shooting and Shortest Paths
Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
✍ Michael T Goodrich; Roberto Tamassia πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 289 KB

We give new methods for maintaining a data structure that supports ray-shooting and shortest-path queries in a dynamically changing connected planar subdivision S S. Our approach is based on a new dynamic method for maintaining a balanced decomposition of a simple polygon via geodesic triangles. We

Ray Shooting Amidst Convex Polygons in 2
Ray Shooting Amidst Convex Polygons in 2D
✍ Pankaj K. Agarwal; Micha Sharir πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 220 KB

We consider the problem of ray shooting in a two-dimensional scene consisting of m convex polygons with a total of n edges. We present a data structure that Ε½ . requires O mn log m space and preprocessing time and that answers a ray Ε½ 2 2 . shooting query in O log m log n time. If the polygons are p