✦ LIBER ✦

Visibility and ray shooting queries in polygonal domains

✍ Scribed by Chen, Danny Z.; Wang, Haitao

Book ID: 125861148
Publisher: Elsevier Science
Year: 2015
Tongue: English
Weight: 436 KB
Volume: 48
Category: Article
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2014.08.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Visibility Queries and Maintenance in Si

Visibility Queries and Maintenance in Simple Polygons

✍ Aronov; Guibas; Teichmann; Zhang 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 212 KB

Query-point visibility constrained short

Query-point visibility constrained shortest paths in simple polygons

✍ Ramtin Khosravi; Mohammad Ghodsi 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 661 KB

Ray shooting in polygons using geodesic

Ray shooting in polygons using geodesic triangulations

✍ B. Chazelle; H. Edelsbrunner; M. Grigni; L. Guibas; J. Hershberger; M. Sharir; J 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 914 KB

Hierarchical Decompositions and Circular

Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons

✍ Siu-Wing Cheng; Otfried Cheong; Hazel Everett; René van Oostrum 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 204 KB

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

Querying two boundary points for shortes

Querying two boundary points for shortest paths in a polygonal domain

✍ Sang Won Bae; Yoshio Okamoto 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 296 KB