3 search results - page 1 / 1 » An Improved Algorithm for Subdivision Traversal without Extr... |
ISAAC
2000
Springer
13 years 8 months ago
2000
Springer
We describe an algorithm for enumerating all vertices, edges and faces of a planar subdivision stored in any of the usual pointer-based representations, while using only a constant...
COMPGEOM
1996
ACM
13 years 9 months ago
1996
ACM
In this paper we show how to traverse a subdivision and to report all cells, edges and vertices, without making use of mark bits in the structure or a stack. We do this by perform...
PG
1999
IEEE
13 years 9 months ago
1999
IEEE
Using object clusters for hierarchical radiosity greatly improves the efficiency and thus usability of radiosity computations. By eliminating the quadratic starting phase very lar...