A linear-time algorithm for solving the strong hidden-line problem in a simple polygon (Q3776622): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-8655(86)90043-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1991157139 / rank | |||
Normal rank | |||
Latest revision as of 19:15, 19 March 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
