Currently, polygonal models are widely used for the representation and visualization of 3D information. The sheer sizes of polygonal models and the limited Internet bandwidth put a threat to their visualization in a distributed environment. Streaming mesh, which consists of a simplified model and refinement patches, is used to overcome this problem. Simplification method and the data structures for refinement patches play crucial role in this approach. By employing distance measure and normal field deviation, we propose a new error measure to faithfully simplify polygonal models, and introduce more efficient data structures for refinement patches. We implement the streaming mesh using Java. Comparison with the state-of-the-art methods revea...
When representing objects with polygonal models, we must often use models consisting of large number...
This paper presents an efficient method of mesh simplification for geometric 3D models. The trans-mi...
The thesis studies the optimization of a specific type of computer graphic representation: polygon-b...
International audienceMany applications in computer graphics require complex and highly detailed mod...
This paper is dedicated to simlification algorithms of polygonal models. First chapter deals with co...
3D graphics has become an increasingly important part in geometric modelling visualization. 3D model...
Abstract — This article presents highly parallel algorithms for remeshing polygonal models guided by...
This paper presents a practical technique to automatically compute approximations of polygonal repre...
Displaying polygonal vector data is essential in various application scenarios such as geometry visu...
Virtual worlds and games increasingly deliver 3D meshes over the Internet using instanced file forma...
We present a new approach for simplifying polygonal objects. Our method is general in that it accept...
This paper proposes a novel method for visualizing the thickness and clearance of 3D objects in a po...
A simple and robust greedy algorithm has been proposed for efficient and quality decimation of polyg...
AbstractThis paper proposes a novel method for visualizing the thickness and clearance of 3D objects...
For twenty years, it has been clear that many datasets are excessively complex for applications such...
When representing objects with polygonal models, we must often use models consisting of large number...
This paper presents an efficient method of mesh simplification for geometric 3D models. The trans-mi...
The thesis studies the optimization of a specific type of computer graphic representation: polygon-b...
International audienceMany applications in computer graphics require complex and highly detailed mod...
This paper is dedicated to simlification algorithms of polygonal models. First chapter deals with co...
3D graphics has become an increasingly important part in geometric modelling visualization. 3D model...
Abstract — This article presents highly parallel algorithms for remeshing polygonal models guided by...
This paper presents a practical technique to automatically compute approximations of polygonal repre...
Displaying polygonal vector data is essential in various application scenarios such as geometry visu...
Virtual worlds and games increasingly deliver 3D meshes over the Internet using instanced file forma...
We present a new approach for simplifying polygonal objects. Our method is general in that it accept...
This paper proposes a novel method for visualizing the thickness and clearance of 3D objects in a po...
A simple and robust greedy algorithm has been proposed for efficient and quality decimation of polyg...
AbstractThis paper proposes a novel method for visualizing the thickness and clearance of 3D objects...
For twenty years, it has been clear that many datasets are excessively complex for applications such...
When representing objects with polygonal models, we must often use models consisting of large number...
This paper presents an efficient method of mesh simplification for geometric 3D models. The trans-mi...
The thesis studies the optimization of a specific type of computer graphic representation: polygon-b...