Learn More
This paper presents a new tool, Metro, designed t o c ompensate for a deeciency in many simpliication methods proposed in literature. Metro allows one to compare the diierence b etween a pair of surfaces e.g. a triangulated mesh and its simpliied r epresentation by adopting a surface sampling approach. It has been designed as a highly general tool, and it(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)
We describe an efficient technique for out-of-core construction and accurate view-dependent visualization of very large surface models. The method uses a regular conformal hierarchy of tetrahedra to spatially partition the model. Each tetrahedral cell contains a precomputed simplified version of the original model, represented using cache coherent indexed(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)
PhotoCloud is a real-time client-server system for interactive visualization and exploration of large datasets comprising thousands of calibrated 2D photographs of a scene and a complex 3D description of the scene. The system isn't tailored to any specific data acquisition process; it aims at generality and flexibility. PhotoCloud achieves scalability(More)