A linear-time algorithm for solving the strong hidden-line problem in a simple polygon (Q3776622): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:47, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear-time algorithm for solving the strong hidden-line problem in a simple polygon |
scientific article |
Statements
A linear-time algorithm for solving the strong hidden-line problem in a simple polygon (English)
0 references
1986
0 references
computer graphics
0 references
computational geometry
0 references
linear-time algorithm
0 references
strong hidden-line problem
0 references
weakly visible
0 references
shortest paths
0 references
triangulation
0 references
