Hidden surface removal for \(c\)-oriented polyhedra (Q1194308)
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 64218
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hidden surface removal for \(c\)-oriented polyhedra |
scientific article; zbMATH DE number 64218 |
Statements
Hidden surface removal for \(c\)-oriented polyhedra (English)
0 references
27 September 1992
0 references
An output-sensitive hidden surface removal algorithm that can deal with cyclic overlap among the objects is given. The method works for any set of polyhedra whose faces have a constant number of different orientations. Let \(n\) be the total number of edges of the polyhedra and \(k\) the complexity of the visibility map. The time complexity of \(O((n+k)\log n)\) improves earlier results on that line. The basic method also works for intersecting polyhedra and for polyhedra, where the number of different orientations of the edges is not bounded. Further results are given and open questions are discussed.
0 references
\(c\)-oriented polyhedra
0 references
output-sensitive algorithms
0 references
hidden surface removal
0 references
0.8911340832710266
0 references
0.8907010555267334
0 references
0.867079496383667
0 references
0.8647717833518982
0 references
0.8445373773574829
0 references
