A topology modifying progressive decimation algorithm

Schroeder,

doi:10.1109/visual.1997.663883

Cited by 67 publications

(45 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…View-dependent uniform [Abi-Ezzi and Shirman 1991; Kumar et al 1996;Kumar et al 1997] and adaptive triangulation [Filip 1986;Vlassopoulos 1990] (as well as a combination of the two [Chhugani and Kumar 2001]) have been employed to render spline models. Alternatively, one may generate a large number of triangles and later perform view-dependent simplification of the triangles [Hoppe 1996;Rossignac and Borrel 1993;Xia et al 1997;Schroeder 1997]. Recently, the two methods have been combined into a single algorithm [Chhugani and Kumar 2001].…”

Section: Related Researchmentioning

confidence: 99%

Budget sampling of parametric surface patches

Chhugani

Kumar

2003

Proceedings of the 2003 Symposium on Interactive 3D Graphics

View full text Add to dashboard Cite

We investigate choosing point samples on a model comprising parametric patches to meet a user specified budget. These samples may then be triangulated, rendered as points or ray-traced. The main idea is to pre-compute a set of samples on the surface and at the rendering time, use a subset that meets the total budget while reducing the screen-space error across the model. We have used this algorithm for interactive display of large spline models on low-end graphics workstations. This is done by distributing the points on the surface to minimize surface error. These points are then drawn as screen-space squares to fill the gaps between them. Our algorithm works well in practice and has a low memory footprint.

show abstract

Section: Related Researchmentioning

confidence: 99%

Budget sampling of parametric surface patches

Chhugani

Kumar

2003

Proceedings of the 2003 Symposium on Interactive 3D Graphics

View full text Add to dashboard Cite

show abstract

“…In this paper we use edge contraction [8,9] as the decimation primitive and the Quadric error metrics [5]. Other multi resolution schemes include vertex removal [1], triangle contraction [6], vertex clustering [16], and wavelet analysis [19,2]. Similar to [4,13,1,6] we organize the levels of detail structure as a DAG (Directed Acyclic Graph).…”

Section: Previous Workmentioning

confidence: 99%

Temporal and spatial level of details for dynamic meshes

Shamir

Pascucci

2001

Proceedings of the ACM Symposium on Virtual Reality Software and Technology

View full text Add to dashboard Cite

Multi-resolution techniques enhance the abilities of visualization systems to overcome limitations in time, space and transmission costs. Numerous techniques have been presented which concentrate on creating level of detail models for static meshes. Timedependent deformable meshes impose even greater difficulties on such systems. In this paper we describe a solution for using level of details for time dependent meshes. Our solution allows for both temporal and spatial level of details to be combined in an efficient manner. By separating low and high frequency temporal information, we gain the ability to create very fast coarse updates in the temporal dimension, which can be adaptively refined for greater details.

show abstract

“…Schroeder and co-workers created one of the earliest polygonal simplification algorithms that successively removes vertices near relatively flat regions [29]. The original algorithm preserved topology, but in more recent work, Schroeder extended this method to allow topological changes [30]. When no more vertices can be removed from the model due to topological restrictions of the algorithm, the method splits apart the polygons adjacent to a vertex.…”

Section: A Simplificationmentioning

confidence: 99%

Volumetric Representation and Manipulation of Geometric Models

Turk¹,

Nooruddin²,

O’Brien³

et al. 2001

View full text Add to dashboard Cite

Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing inslrurtrans sea^"« *^™"?Av, ",«.,. coltection gathering and maintaining the data needed, and completing and reviewing the collection of informal™. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES)Georgia Tech Research Corporation Georgia Institute of Technology Atlanta GA 30332-0420 SPONSORING/MONITORING AGENCY NAME(S) AND ADDRESS(ES)Office of Naval Research, Ballston Centre Tower One 800 North Quincy Street Arlington VA 22217-5660 ABSTRACTThis is the final report of the work that was funded by the ONR contract number N00014-97-1-0223. The goal of this research project was to investigate new methods of representing and manipulating three-dimensional geometric models using volumetric techniques. Three sub-areas were particular targets for these investigations: 1) explore ways of extending the kinds of models that can be represented volumetrically, 2)create nultiresolution models using volume techniques, and 3) perform shape transformation using a volumetric framework. SUBJECT TERMS 3D Geometric Models AbstractWe present an algorithm for automatically classifying the interior and exterior parts of a polygonal model. The need for visualizing the interiors of objects frequently arises in medical visualization and CAD modeling. The goal of such visualizations is to display the model in a way that the human observer can easily understand the relationship between the different parts of the surface. While there exist excellent methods for visualizing surfaces that are inside one another (nested surfaces), the determination of which parts of the surface are interior is currently done manually. Our automatic method for interior classification takes a sampling approach using a collection of direction vectors. Polygons are said to be interior to the model if they are not visible in any of these viewing directions from a point outside the model. Once we have identified polygons as being inside or outside the model, these can be textured or have different opacities applied to them so that the whole model can be rendered in a more comprehensible manner. An additional consideration for some models is that they may have holes or tunnels running through them that are connected to the exterior surface. Although an external observer can see into these holes, it is often desirable to mark the walls of such tunnels as being part of the interior of a model. In order to allow this modified classification of the interior, we use morphological operators to close all the holes of the model. An input model is used together with its closed version to provide a better classification of the portions of the original model.

show abstract

A topology modifying progressive decimation algorithm

Cited by 67 publications

References 9 publications

Budget sampling of parametric surface patches

Budget sampling of parametric surface patches

Temporal and spatial level of details for dynamic meshes

Volumetric Representation and Manipulation of Geometric Models

Contact Info

Product

Resources

About