Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (Q1101226)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons |
scientific article; zbMATH DE number 4047110
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons |
scientific article; zbMATH DE number 4047110 |
Statements
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (English)
0 references
1987
0 references
computational geometry
0 references
triangulation
0 references
simple polygon
0 references
linear-time algorithms
0 references
shortest paths
0 references
visibility
0 references
ray shooting
0 references
