9 search results - page 2 / 2 » Efficient Regular Polygon Dissections |
MICRO
2000
IEEE
13 years 9 months ago
2000
IEEE
Many data-parallel applications, including emerging media applications, have regular structures that can easily be expressed as a series of arithmetic kernels operating on data st...
VMV
2000
13 years 6 months ago
2000
The use of polygonal meshes, especially triangle meshes, is manifold but a lot of algorithms require the mesh to be structured in a certain way and cannot be applied to an arbitra...
SIGGRAPH
1996
ACM
13 years 9 months ago
1996
ACM
We present an algorithm for real-time level of detail reduction and display of high-complexity polygonal surface data. The algorithm uses a compact and efficient regular grid repr...
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...