Converting NURBS based CAD Data into polygonal data often leads to unconnected faces at patch borders, wrong sided face normals and holes in the calculated mesh. Several methods are described in this paper to overcome these problems. The tesselation also results in a huge amount of polygons. To conquer such large data sets, different decimation algorithms are described and compared. All these tools are embedded in the Delphi viewer. Delphi provides an interactive environment including scientific visualization for decimation previewing, parameter distribution, and vertex classification, all superimposed on the data sets
Polygonal models are the most common representation of 3D data in computer graphics and in reverse e...
This paper presents an incremental approach for tessellating trimmed parametric surfaces. A database...
Abstract — This paper presents a fast method to avoid cracks between two adjacent NURBS-surfaces whi...
For twenty years, it has been clear that many datasets are excessively complex for applications such...
Fast, reliable, and feature preserving automatic decimation of polygonal models is a challenging tas...
It is imperative for CAD, solid modeling, grid generation, and data exchange applications that a com...
It is imperative for CAD, solid modeling, grid generation, and data exchange applications that a com...
Most of the existing algorithms for decimation of triangular meshes perform poorly at very low level...
Tessellation of trimmed NURBS surfaces is classical problem in CAD/CAM, with long history and huge a...
In automatic decimation of polygonal models, the measure of geometric fidelity plays the key role. A...
In this paper, we describe two different forms of the error metric proposed in [5] for computing loc...
A general algorithm for decimating unstructured discretized data sets is presented. The discretized ...
The aim of the computer graphics is to visualise models of real-world objects. The visualization of ...
A fast greedy algorithm for automatic decimation of polygonal meshes is proposed. Two important comp...
Interactive rendering of trimmed NURBS models is of great importance for CAD systems. For this the m...
Polygonal models are the most common representation of 3D data in computer graphics and in reverse e...
This paper presents an incremental approach for tessellating trimmed parametric surfaces. A database...
Abstract — This paper presents a fast method to avoid cracks between two adjacent NURBS-surfaces whi...
For twenty years, it has been clear that many datasets are excessively complex for applications such...
Fast, reliable, and feature preserving automatic decimation of polygonal models is a challenging tas...
It is imperative for CAD, solid modeling, grid generation, and data exchange applications that a com...
It is imperative for CAD, solid modeling, grid generation, and data exchange applications that a com...
Most of the existing algorithms for decimation of triangular meshes perform poorly at very low level...
Tessellation of trimmed NURBS surfaces is classical problem in CAD/CAM, with long history and huge a...
In automatic decimation of polygonal models, the measure of geometric fidelity plays the key role. A...
In this paper, we describe two different forms of the error metric proposed in [5] for computing loc...
A general algorithm for decimating unstructured discretized data sets is presented. The discretized ...
The aim of the computer graphics is to visualise models of real-world objects. The visualization of ...
A fast greedy algorithm for automatic decimation of polygonal meshes is proposed. Two important comp...
Interactive rendering of trimmed NURBS models is of great importance for CAD systems. For this the m...
Polygonal models are the most common representation of 3D data in computer graphics and in reverse e...
This paper presents an incremental approach for tessellating trimmed parametric surfaces. A database...
Abstract — This paper presents a fast method to avoid cracks between two adjacent NURBS-surfaces whi...