Schroeder, W., "A Topology Modifying Progressive Decimation Algorithm," IEEE Visualization '97: pp. 205-212.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....topology of the original object and give a global error bound on surface deviation. DLW93, EDD 95] have presented algorithms for multi resolution analysis for surfaces of arbitrary topology types. 4 Other simplification algorithms include decimation techniques based on vertex removal [SZL92, Sch97] and controlled topology modification [ESV97] EM98b] have a presented a topology simplification algorithm that produces high quality simplifications. All these algorithms generate a few static LODs. Hoppe [Hop96] has introduced progressive meshes to incrementally represent various LOD. Based on ....

W. Schroeder. A topology modifying progressive decimation algorithm. In Proceedings of Visualization'97, pages 205--212, 1997.

.... of static geometric data for graphics and visualization [7, 15, 13, 10] 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) Each node in the DAG represents a decimation operation and the edges represent dependencies between the different operations, which impose a certain partial order ....

William J. Schroeder. A topology modifying progressive decimation algorithm. In Roni Yagel and Hans Hagen, editors, IEEE Visualization 97, pages 205--212. IEEE, November 1997.

....of the observer. 4 DATA SIMPLIFICATION TECHNIQUES The need for ever increasing high end interactive visualization methods for large scale datasets has been one of the driving forces for a survey of existing geometry based data reduction techniques. Inspired by some of such existing algorithms [1, 3, 4, 5, 6, 9, 10, 11, 12, 13, 14, 15, 16], we created adapted tetrahedral based simplification schemes to reduce the size complexity of the model [8] As a result, we are now ready to navigate in an immersive, near interactive, temporal volume model of the simulation outputs. 5 ONGOING AND FUTURE WORK This large scale data research ....

Schroeder, William J. A Topology Modifying Progressive Decimation Algorithm. In Proceedings of IEEE Visualization '97, pages 205-212. 1997.

....and a series of vertex split records that can be applied to refine the basic mesh back to the original representation at full resolution. This representation permits geo morphing and progressive transmission along with significant compression and support for selective refinement. Schroeder [17] extends his previous work on triangle mesh decimation [16] He proposes a new algorithm that guarantees a specified level of reduction, but modifies the topology while performing local decimation to achieve the result. He includes two additional primitive operations in the algorithm: vertex ....

....of space and control parameters discourage the cases of self intersection of boundaries, element boundary intersections, and negative volume tetrahedra. Additional compression could still be achieved by decimation of external faces of the boundary tetrahedra using edge collapse based methods [1, 5, 8, 9, 10, 15, 16, 17, 22], or by concise representations of the boundary surfaces [7, 9] For further offline compression of the datasets, schemes like the ones suggested by Gumhold et al. 6] Pajarola et al. 13] or Szymczak et al. 19] present a nice platform for integration with TetFusion. At an application level, ....

Schroeder, William J. A Topology Modifying Progressive Decimation Algorithm. In Proceedings of IEEE Visualization '97, pages 205-212. 1997.

.... of recent algorithms is presented in [Lue01] Algorithms for simplifying large environments can be classified as either static (view independent) or dynamic (view dependent) Static approaches precompute a discrete series of levels of detail (LODs) in a view independent manner [EM99, GH97, RB93, Sch97] Erikson et al. EMB01] presented an approach to large model rendering based on the hierarchical use of static LODs, or HLODs. We also use LODs and HLODs in our system. At run time, rendering algorithms for static LODs choose an appropriate LOD to represent each object based on the viewpoint. ....

W. Schroeder. A topology modifying progressive decimation algorithm. In Proceedings of Visualization'97, pages 205--212, 1997.

....If a decimation scheme is also able to simplify the topology of the input model, we have to use non Euler removal operators. The most common operator in this class is the vertex contraction where two vertices p and q can be contracted into one new vertex r even if they are not connected by an edge [16,54]. This opera Simplification and Compression Vertex Removal Vertex Insertion Edge Collapse Edge Split 11 Half Edge Collapse :Restricted Vertex Split Fig. 3. Euler operations for incremental mesh decimation and their inverses: vertex removal, full edge collapse, and hMf edge ....

Schroeder, W. (1997) A topology modifying progressive decimation algorithm, Proc. IEEE Vis.'97, 205-212

....1. 1 Previous Work There are many approaches for creating multi resolution representations of geometric data for graphics and visualization [8, 11, 14, 16] They vary in both the simplification scheme like vertex removal [1] edge contraction [9, 10] triangle contraction [7] vertex clustering [17], wavelete analysis [2, 20] and in the 1 structure used to organize the levels of detail (either linear order [9, 11] or in a DAG [1, 5, 7, 14] However, these works assume the finest resolution mesh is static and build a static multi resolution representation. Our scheme draws from many of ....

William J. Schroeder. A topology modifying progressive decimation algorithm. In Roni Yagel and Hans Hagen, editors, IEEE Visualization 97, pages 205--212. IEEE, November 1997.

....complexity of the geometric error estimation. A straightforward solution to (over ) estimate the current error during the reduction process is to compute the deviation of the submesh T 0 i that replaces the mesh T i in the ith step of the reduction and to accumulate these contributions locally [27, 4]. In general, this leads to a very coarse but conservative estimate of the true error. Accumulating not only the pure distance but an error quadric bounding the region of allowable deviation, leads to much better results [10] Several authors have tried to estimate the true geometric deviation of ....

W. Schroeder. A Topology Modifying Progressive Decimation Algorithm. In Proceedings of IEEE Visualization '97, 205--212, 1997.

.... places new vertices with curvature dependent density into the original mesh and thereafter removes the original ones (retiling) Rossignac and Borrel [581] use a coarse threedimensional grid to merge all vertices within one voxel (vertex clustering) Most frequently iterative approaches are used [624, 327, 111, 389, 324, 579, 237, 374, 621, 622, 104]. Topological and geometrical operations are used to remove vertices, edges or triangles from the dense mesh. This process is iterated until a given approximation error is reached or until no further thinning is possible. Alternative algorithms start with a coarse approximation that is refined ....

....and the original one [389] Since it is computationally expensive and impractical to compare the thinned mesh with the original one after each iteration, local methods estimate the global error [134, 579, 237, 374] e.g. see Section 4.3. 4) or simply evaluate the difference between two iterations [624, 605, 384, 621]. Merely using distance measures may result in surfaces with small approximation error but poor quality (see Figure 4.12) Hence, some authors use additional quality measures that evaluate the curvature characteristics of the resulting mesh [374, 104] or minimize the energy of a spring model ....

W. J. Schroeder. A topology modifying progressive decimation algorithm. In R. Yagel and H. Hagen, editors, IEEE Visualization '97, pages 205--212. IEEE, November 1997.

....In depth and exhaustive surveys of the algorithms for the reduction of geometric primitives can be found in [11] or [22] In this section we restrict ourselves to the analysis of the algorithms which allow the modification (and reduction) of mesh topology. The algorithm proposed by Schroeder [25] extends a previous topology preserving solution [27] The vertices of the input mesh are first classified according to their local topology and geometry, and an error is assigned to them. The vertices are then inserted into a priority queue in which high priority means small error introduced. The ....

W. J. Schroeder. A topology modifying progressive decimation algorithm. In Roni Yagel and Hans Hagen, editors, IEEE Visualization 97, pages 205--212. IEEE, November 1997.

....a point set by succesive flips from an arbitrary initial triangulation of the point set (see [7] Their main characteristic is to change incrementally the mesh towards something of better quality. For instance, local changes are used in compression (or simplification) techniques for visualization [15]. Also different type of physical data may be associated to an evolving triangulation, data that required to be smoothly adapted to a new topology [4] When one of the fields associated to the vertices is some height, then changes of topology appear to be relevant to keep some quality of the mesh ....

W.J. Schroeder, A topology modifying progressive decimation algorithm, In Proceeding of the IEEE Visualization'97, pp. 205--213, Phoenix, Arizona, October 1997.

....the value range of the volume in order to eliminate cells in advance, that do not contribute triangles to the requested iso surface (Wilhelm et. al [21] and Shen et al. 15] Another acceleration technique is the decimation of the produced polygons in a post processing step as done by Schroeder [12, 13] or the adaptive reduction of the volume data itself to generate fewer polygons more quickly as it was done by Cignoni et al. 2] or Grosso et al. 5] The deformable surface approach falls into the catagorie of the indirect visualization methods. By emphasizing boundary structures instead of ....

W. J. Schroeder. A Topology Modifying Progressive Decimation Algorithm. In R. Yagel and H. Hagen, editors, Proceedings IEEE Visualization '97, pages 205--219, 1997.

....of the data and progressive refinement of the image can overcome a number of the difficulties outlined above. Progressive refinement of the image as the data comes in from the remote server is one way of enhancing interactivity, while still eventually rendering a highquality image, Schroeder [2]. For progressive transmission, volume datasets are represented through continuous families of levels ofdetail (LoDs) datasets. On transmission at the coarsest resolution, a fundamental visualisation is presented to the user; as finer LODs are transmitted, the visualisation is gradually updated. ....

W. Schroeder, "A Topology Modifying Progressive Decimation Algorithm", Visualisation '97, IEEE Press, pp 205-212, 1997

....are essential for practical use: ffl Robustness of the algorithm: most real world data contain topological inconsistencies, e.g. complex vertices. Thus, algorithms assuming the input data coming as (bounded) 2manifolds would fail. This aspect can be handled by topology modifying algorithms [5, 17, 12, 7]. ffl Intuitive parameters to steer the reduction: most people using mesh reduction software are not experts in the field of computer graphics algorithms. Thus, intuitive parameters to control the simplification process are strongly required. ffl Thoughtful use of computer hardware resources: ....

....are not experts in the field of computer graphics algorithms. Thus, intuitive parameters to control the simplification process are strongly required. ffl Thoughtful use of computer hardware resources: mesh reduction techniques have to be fast, e.g. with respect to Schroeder s recent definition [17] of 10 8 reduced triangles per day. Yet, the reduction process has to fit into the memory of current computer systems. The performance of computer systems is increasing steadily, considering CPU speed, the size of main memory, and the triangle throughput of computer graphics hardware. Looking ....

[Article contains additional citation context not shown here]

William J. Schroeder. A Topology Modifying Progressive Decimation Algorithm. In IEEE Visualization '97, Conference Proceedings, pages 205--212, 1997.

....nearly passing through adjacent vertices as their priority measure [20] No history of the original geometry is kept during this process. A more recent variant of this technique includes a scalar value at each vertex that encodes the maximum error created so far in the neighborhood of the vertex [21]. Renze and Oliver concentrate on triangulation algorithms in their work, and they use the same distance to plane method as Schroeder [17] Hamann uses a measure of local curvature to decide which vertices to remove, and here again no history of the original surface is used to guide these ....

SCHROEDER, W. J. A Topology Modifying Progressive Decimation Algorithm. In IEEE Visualization '97 Proceedings, October 1997, pp. 205--212.

No context found.

Schroeder, W., "A Topology Modifying Progressive Decimation Algorithm," IEEE Visualization '97: pp. 205-212.

No context found.

W.J. Schroeder, A topology modifying progressive decimation algorithm, In Proceeding of the IEEE Visualization'97, pp. 205--213, Phoenix, Arizona, October 1997.

No context found.

W. Schroeder. A topology modifying progressive decimation algorithm. In IEEE Visualization '97 Proceedings, pages 205 # 212. ACM#SIGGRAPH Press, 1997.

No context found.

W, Schroeder, A topology modifying Progressive Decimation Algorithm, in Multiresolution Surface Modeling Course, ACM Siggraph Course notes 25, Los Angeles, 1997.

No context found.

William J. Schroeder. A topology modifying progressive decimation algorithm. Proceedings of Visulaization '97, pages 205--212, 1997. IEEE Computer Society Press.

No context found.

W. Schroeder. A topology modifying progressive decimation algorithm. In IEEE Visualization '97 Proceedings, pages 205 -- 212. ACM/SIGGRAPH Press, October 1997.

No context found.

W. J. Schroeder. A topology modifying progressive decimation algorithm. In IEEE Vis. 97, pages 205--212.

No context found.

W.J. Schroeder, "A topology modifying progressive decimation algorithm", IEEE Visualization 97 Conference Proceedings, pp. 205-212, 545, 1997.

No context found.

W. J. Schroeder. A topology modifying progressive decimation algorithm. In R. Yagel and H. Hagen, editors, IEEE Visualization '97, pages 205--212. IEEE, November 1997.

No context found.

William J. Schroeder. A topology modifying progressive decimation algorithm. In IEEE Visualization 97 Conference Proceedings, pages 205--212,545, 1997.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC