Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles (Q4507375)
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 1519277
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles |
scientific article; zbMATH DE number 1519277 |
Statements
Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles (English)
0 references
18 October 2000
0 references
simple polygon
0 references
obstacles
0 references
visibility graph
0 references
triangulation
0 references
linked lists
0 references
output-sensitive
0 references
0.8690344095230103
0 references
0.842055082321167
0 references
0.8287108540534973
0 references
0.8263043165206909
0 references
