Learn More
In many applications the need for an accurate simplification of surface meshes is becoming more and more urgent. This need is not only due to rendering speed reasons, but also to allow fast transmission of 3D models in network-based applications. Many different approaches and algorithms for mesh simplification have been proposed in the last few years. We(More)
The interval tree is an optimally eecient search structure proposed by Edelsbrunner 5] to retrieve intervals of the real line that contain a given query value. We propose the application of such a data structure to the fast location of cells intersected by an isosurface in a volume dataset. The resulting search method can be applied to both structured and(More)
— Very large triangle meshes, i.e. meshes composed of millions of faces, are becoming common in many applications. Obviously, processing, rendering, transmission and archival of these meshes are not simple tasks. Mesh simplification and LOD management are a rather mature technology that in many cases can efficiently manage complex data. But only few(More)
The paper deals with Delaunay Triangulations (DT) in Ed space. This classic computational geometry problem is studied from the point of view of the efficiency, extendibility to any dimensionality, and ease of implementation. A new solution to DT is proposed, based on an original interpretation of the well-known Divide and Conquer paradigm. One of the main(More)
In this paper we propose a new approach for mapping and blending textures on 3D geometries. The system starts from a 3D mesh which represents a real object and improves this model with pictorial detail. Texture detail is acquired via a common photographic process directly from the real object. These images are then registered and stitched on the 3D mesh, by(More)
A method is proposed which supports the extraction of isosurfaces from irregular volume data, represented by tetrahedral decomposition , in optimal time. The method is based on a data structure called interval tree, which encodes a set of intervals on the real line, and supports efficient retrieval of all intervals containing a given value. Each cell in the(More)
A scattered volumetric dataset is regarded as a sampled version of a scalar eld deened over a three-dimensional domain , whose graph is a hypersurface embedded in a four-dimensional space. We propose a multiresolution model for the representation and visualization of such dataset, based on a decomposition of the three-dimensional domain into tetrahedra.(More)
The paper goal is to fit trilinear iso-surfaces out of volume data, by adopting an adaptive mesh refinement approach and therefore supporting a higher accuracy with respect to standard MC solutions. In order to be correct, adaptive refinement must be applied to a topologically correct initial mesh patch. For this reason, we designed a new, Exhaustive Look(More)