When representing objects with polygonal models, we must often use models consisting of large number of polygons. If we want to work in real time with such model the model must be simplificated. The process of simplification is called decimation. We know several decimation techniques for simplification of models. According to characteristics of model and target features of simplified model, we want to choose suitable method. So we need to know characteristics of particular methods and also their limits
A simple and robust greedy algorithm has been proposed for efficient and quality decimation of polyg...
Visualization of three-dimensional (3D) computer-aided design model is an integral part of the desig...
Current technology provides a means to obtain sampled data that digitally describes three-dimensiona...
This paper is dedicated to simlification algorithms of polygonal models. First chapter deals with co...
For twenty years, it has been clear that many datasets are excessively complex for applications such...
VYSOKÉ UČENÍ TECHNICKÉ V BRNĚ The purpose of this work is to design and implement a computer system,...
Mesh simplification is a key research area in scientific visualization and virtual reality. The pape...
Several recent SIGGRAPH papers on surface simplification are described. Keywords: Mesh simplificati...
Fast, reliable, and feature preserving automatic decimation of polygonal models is a challenging tas...
Conventional wisdom says that in order to produce high-quality simplified polygonal models, one must...
Conventional wisdom says that in order to produce high-quality simplified polygonal models, one must...
V článku je představen nový algoritmus pro redukce trojúhelníkových sítí s ohledem na zachování podo...
Analysis programs have been having to deal with more and more complex objects as the capability to m...
This paper presents a practical technique to automatically compute approximations of polygonal repre...
In this paper, we describe two different forms of the error metric proposed in [5] for computing loc...
A simple and robust greedy algorithm has been proposed for efficient and quality decimation of polyg...
Visualization of three-dimensional (3D) computer-aided design model is an integral part of the desig...
Current technology provides a means to obtain sampled data that digitally describes three-dimensiona...
This paper is dedicated to simlification algorithms of polygonal models. First chapter deals with co...
For twenty years, it has been clear that many datasets are excessively complex for applications such...
VYSOKÉ UČENÍ TECHNICKÉ V BRNĚ The purpose of this work is to design and implement a computer system,...
Mesh simplification is a key research area in scientific visualization and virtual reality. The pape...
Several recent SIGGRAPH papers on surface simplification are described. Keywords: Mesh simplificati...
Fast, reliable, and feature preserving automatic decimation of polygonal models is a challenging tas...
Conventional wisdom says that in order to produce high-quality simplified polygonal models, one must...
Conventional wisdom says that in order to produce high-quality simplified polygonal models, one must...
V článku je představen nový algoritmus pro redukce trojúhelníkových sítí s ohledem na zachování podo...
Analysis programs have been having to deal with more and more complex objects as the capability to m...
This paper presents a practical technique to automatically compute approximations of polygonal repre...
In this paper, we describe two different forms of the error metric proposed in [5] for computing loc...
A simple and robust greedy algorithm has been proposed for efficient and quality decimation of polyg...
Visualization of three-dimensional (3D) computer-aided design model is an integral part of the desig...
Current technology provides a means to obtain sampled data that digitally describes three-dimensiona...