33 search results - page 2 / 7 » Accelerated Splatting using a 3D Adjacency Data Structure |
TITB
2008
13 years 5 months ago
2008
Medical image interpretation is facing an important challenge resulting from the continuously increasing amount of imaging data. Innovations in medical image visualization are nece...
SI3D
2005
ACM
13 years 11 months ago
2005
ACM
We present a new interactive method to texture complex geometries at very high resolution, while using little memory and without the need for a global planar parameterization. We ...
CGF
2004
13 years 5 months ago
2004
In recent years it has been shown that, above a certain complexity, points become the most efficient rendering primitives. Although the programmability of the lastest graphics har...
CPM
2011
Springer
12 years 9 months ago
2011
Springer
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
ICPR
2002
IEEE
13 years 10 months ago
2002
IEEE
This paper presents a fast mesh simplification algorithm that combined the half-edge data structure with modified quadric error metric (QEM). When half-edge structure is used, the...