T. He, A. Varshney, , and S. Wang, "Controlled topology simplification," IEEE Transactions on Visualization and Computer Graphics, 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... on regular grids, a number of different proposals have been presented, based on the use of octrees or regular grid to encode distance fields (scalar fields that specify the minimum distance to a shape [7, 10] or simple grids whose data values are obtained by filtering and sampling techniques [14]. However, we do not want to deepen this aspect because we are not proposing a new representation scheme (in this sense, for example, distance fields offer a greater completeness) we propose MI as a simple surface to surface filter based on resampling. In this sense our solution does not assure, ....

....The MC does not need to compute intersections by means of linear interpolations because the discretization step leads to a binary model. Filters are finally used to smooth the returned surfaces and a classic algorithm for geometrical simplification is applied. The algorithm proposed by He et al. [14] uses a voxel model for the discretization of the input model and then applies a MC like algorithm to reconstruct the surface. The authors use an adaptive MC in order to get a reduction of the returned geometric primitives. The value assigned to each voxel node is the signed distance between the ....

[Article contains additional citation context not shown here]

T. He, L. Hong, A. Varshney, and S. Wang. Controlled topology simplification. IEEE Trans. on Visualization & Computer Graphics, 2(2):171--183, 1996.

....simplification and multiresolution surface reconstruction in the literature. Survey papers [7,17] extensively describe, classify and survey various approaches. The simplification and reconstruction techniques can be mainly categorized as: polygon merging [8] wavelets [13] volumetric approach [6], vertex clustering [18] energy function minimization [9,10] hierarchical representation, re tiling [21] and decimation of vertices [20] edges or polygons. We herein just review some typical algorithms. 2.1 Terrain surface reconstruction Terrain surface or a height field is a function of two ....

T. He, L. Hong, A. Varshney, and S. Wang, "Controlled Topology Simplification", IEEE Trans. on Visualization & Computer Graphics, 2(2), pp. 171-184, June 1996.

.... levels and then converted into a (simplified) boundary representation; alternatively, an intermediate voxel based hierarchical representation (builtusing signal processing techniques for the controlled elimination of high frequency details) together with adaptive surface fitting, was proposed in [19, 20]. 2.1 A characterization A classification of the simplification approaches can be based on the characterization of the input output data domain, on the simplification goal, on the strategy adopted to drive evaluate mesh approximation, and, last but not least, by considering if the simplification ....

....x yes no reloc. no comm.prod. Percept.Clust. 34] Min # e x yes no unch. yes 0.1 0.05 not avail. Quadric Err.Matr. 13] both x v pairs x no x no reloc. no 4.5 not avail. Intermediate Hierarchical Representation Approaches Octree based [2] Min # x yes no reloc. no not avail. Voxel based [20] Min # x yes no reloc. no not avail. Other Approaches Re Tiling [44] Min v x no yes reloc. no not avail. Multires.Anal. 10] Min # x yes x yes reloc. no 0.04 not avail. Table 1: Characterization of different simplification algorithms. 3 Simplification Error Evaluation This ....

[Article contains additional citation context not shown here]

T. He, L. Hong, A. Varshney, and S. Wang. Controlled topology simplification. IEEE Trans. on Visualization & Computer Graphics, 2(2):171--183, 1996.

....in these areas is briefly surveyed next. 2. 1 Topology reducing Multiresolution Hierarchies While there has been a significant amount of work done on creation of topology preserving multiresolution hierarchies, much less attention has been focussed on creation of topology simplifying hierarchies [7, 12, 13]. Rossignac and Borrel s algorithm [7] subdivides the model by a global grid and uses a vertex clustering approach within each grid cell. All vertices that lie within a grid cell are combined and replaced by a new vertex. The polygonal mesh is suitably updated to reflect this. The nice properties ....

....of degeneracies often found in real life polygonal datasets. This approach simplifies the genus if the desired simplification regions fall within a grid cell. However, it makes no guarantees about genus reduction and fine control over the genus simplification is not easy to achieve. He et al. [12] present an algorithm to perform a controlled simplification of the genus of an object. It is a good approach that is applicable to volumetric objects on a voxel grid. It can handle degeneracies. However, since it works in the volumetric domain, polygonal objects have to be first voxelized. This ....

T. He, L. Hong, A. Varshney, and S. Wang, "Controlled topology simplification," IEEE Transactions on Visualization and Computer Graphics, vol. 2, no. 2, pp. 171--184, June 1996.

.... Introduction Traditional approaches to graphics acceleration for the navigation of a three dimensional environment have involved: # reducing the geometric complexity of the scene, by using level of detail hierarchies (Turk, 1992; Schroeder, Zarge and Lorensen, 1992; Rossignac and Borrel, 1993; Cohen et al. 1996; Hoppe, 1996; DeRose, Lounsbery and Warren, 1993; He et al. 1996) and by visibility based culling(Airey, 1990; Teller and Sequin, 1991; Greene and Kass, 1993; Luebke and Georges, 1995; Greene, 1996) # reducing the rendering complexity by using texture mapping (Blinn and Newell, 1976; Blinn, ....

.... navigation of a three dimensional environment have involved: # reducing the geometric complexity of the scene, by using level of detail hierarchies (Turk, 1992; Schroeder, Zarge and Lorensen, 1992; Rossignac and Borrel, 1993; Cohen et al. 1996; Hoppe, 1996; DeRose, Lounsbery and Warren, 1993; He et al. 1996), and by visibility based culling(Airey, 1990; Teller and Sequin, 1991; Greene and Kass, 1993; Luebke and Georges, 1995; Greene, 1996) # reducing the rendering complexity by using texture mapping (Blinn and Newell, 1976; Blinn, 1978) and by using vari # luciad msn.com, Recently graduated from ....

He, T., Hong, L., Varshney, A., and Wang, S. (1996). Controlled topology simplification. IEEE Transactions on Visualization and Computer Graphics, 2(2):171--184.

No context found.

T. He, A. Varshney, , and S. Wang, "Controlled topology simplification," IEEE Transactions on Visualization and Computer Graphics, 1996.

No context found.

HE, T., HONG, L., VARSHNEY, A., AND WANG, S. W. 1996. Controlled topology simplification. IEEE Trans. on Visualization and Computer Graphics 2, 2, 171--184.

No context found.

T. He, L. Hong, A. Varshney, and S. W. Wang. Controlled topology simplification. IEEE Trans. on Visualization and Computer Graphics, 2(2):171--184, 1996.

No context found.

T. He, L. Hong, A. Varshney, and S. Wang, `Controlled topology simplification', IEEE Transactions on Vizualization and Computer Graphics, 2(2), 171--184, (June 1996).

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