Visibility and ray shooting queries in polygonal domains (Q2261573)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6412862
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Visibility and ray shooting queries in polygonal domains |
scientific article; zbMATH DE number 6412862 |
Statements
Visibility and ray shooting queries in polygonal domains (English)
0 references
6 March 2015
0 references
This paper is dedicated to the study of an important topic in computational geometry, namely the visibility polygons. The authors presents new results, new algorithms and data structures which improve the previous known results on this topic. In conclusion, the paper is well written and the authors propose new data structures for ray-shooting queries and computing visibility polygons for query points in polygonal domains.
0 references
visibility polygons
0 references
ray-shootings
0 references
visibility queries
0 references
polygonal domains
0 references
algorithms
0 references
computational geometry
0 references
algorithm
0 references
0 references
0 references
0 references
0.9235884547233582
0 references
0.7764911651611328
0 references
0.7668147683143616
0 references
0.7612977623939514
0 references
