SIGGRAPH
2000
ACM
14 years 3 days ago
2000
ACM
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...
GECCO
2006
Springer
14 years 5 days ago
2006
Springer
Program bloat is a fundamental problem in the field of Genetic Programming (GP). Exponential growth of redundant and functionally useless sections of programs can quickly overcome...
EDUTAINMENT
2007
Springer
14 years 13 days ago
2007
Springer
High compression of plant geometry is an important aspect in fast realistic visualization of plants. Hierarchical structuring plant morphology is a key factor for real time plant r...
COMPGEOM
2007
ACM
14 years 14 days ago
2007
ACM
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...
RT
2001
Springer
14 years 29 days ago
2001
Springer
We present a framework for accelerating interactive rendering, grounded in psychophysical models of visual perception. This framework is applicable to multiresolution rendering te...
SI3D
2003
ACM
14 years 1 months ago
2003
ACM
We present a new algorithm for best-effort simplification of polygonal meshes based on principles of visual perception. Building on previous work, we use a simple model of low-lev...
VISUALIZATION
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper a new quadric-based view-dependent simplification scheme is presented. The scheme provides a method to connect mesh simplification controlled by a quadric error metr...
ICMCS
2006
IEEE
14 years 2 months ago
2006
IEEE
Three-dimensional data generated from range scanners is usually composed of a huge amount of information. Simplification and compression techniques must be adopted in order to red...