Sciweavers

8 search results - page 1 / 2
» A Novel Cache-based Approach to Large Polygonal Mesh Simplif...
Sort
View
48
Voted
JISE
2006
64views more  JISE 2006»
15 years 23 days ago
A Novel Cache-based Approach to Large Polygonal Mesh Simplification
Hung-Kuang Chen, Chin-Shyurng Fahn, Jeffrey J. P. ...
115
Voted
SIGGRAPH
2000
ACM
15 years 4 months ago
Out-of-core simplification of large polygonal models
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
Peter Lindstrom
120
Voted
TOG
2008
130views more  TOG 2008»
15 years 21 days ago
Quadrilateral mesh simplification
We introduce a simplification algorithm for meshes composed of quadrilateral elements. It is reminiscent of edge-collapse based methods for triangle meshes, but takes a novel appr...
Joel Daniels II, Cláudio T. Silva, Jason Sh...
CGA
2008
15 years 28 days ago
Legible Simplification of Textured Urban Models
Mesh simplification and discrete levels of detail (LOD) are wellstudied areas of research in computer graphics. However, until recently, most of the developed algorithms have focu...
Remco Chang, Thomas Butkiewicz, Caroline Ziemkiewi...
97
Voted
CGI
2006
IEEE
15 years 4 months ago
Feature Sensitive Out-of-Core Chartification of Large Polygonal Meshes
Mesh chartification is an important tool for processing meshes in various applications. In this paper, we present a novel feature sensitive mesh chartification technique that can h...
Sungyul Choe, Minsu Ahn, Seungyong Lee