Carl Erikson
- Clark76.Clark, J. "Hierarchical Geometric Models for Visible Surface Algorithms," Communications of the ACM, 547- 554, 1976. Google Scholar
Digital Library
- Cohen96.Cohen, J., Varslmey, A., Manocha, D., Turk, G., Weber, H., Agarwal, P., Brooks, E, and Wright, W. "Simplification Envelopes," Computer Graphics (SIGGRAPH '96 Proceedings), 119-128, 1996. Google ScholarDigital Library
- Cohen97.Cohen, J., Manocha, D., and Olano, M. "Simplifying Polygonal Models Using Successive Mappings," IEEE Visualization "97 Proceedings, 395-402, 1997. Google ScholarDigital Library
- Cohen98.Cohen, J., Olano, M., and Manocha, D. "Appearance- Preserving Simplification," Computer Graphics (SIGGRAPH "98 Proceedings), 115-122. Google ScholarDigital Library
- Cignoni98.Cignoni, P., Montani, C., Rocchini, C., and Scopigno, R. "A General Method for Preserving Attribute Values on Simplified Meshes," IEEE Visualization '98 Proceedings, 59-66, 1998. Google ScholarDigital Library
- Eck95.Eck, M., DeRose, T., Duchamp, T., Hoppe, H., Lounsbery, M., and Stuetzle, W. "Multiresolution Analysis of Arbitrary Meshes," Computer Graphics (SIGGRAPH "95 Proceedings), 173-182, 1995. Google ScholarDigital Library
- El-Sana97.E1-Sana, J., and Varshney, A. "Controlled Simplification of Genus for Polygonal Models," IEEE Visualization "97 Proceedings, 403-410, 1997. Google ScholarDigital Library
- Erikson98.Erikson, C., and Manocha, D. "Simplification Culling of Static and Dynamic Scene Graphs," UNC Chapel Hill Computer Science Technical Report TR98-009, 1998. Google ScholarDigital Library
- Garland97a.Garland, M., and Heckbert, P. "Surface Simplification Using Quadric Error Metrics," Computer Graphics (SIGGRAPH "97 Proceedings), 209-216, 1997. Google ScholarDigital Library
- Garland97b.Garland, M. "QSlim Simplification Software," http ://www.cs. cmu.edu/~garland/quadricsdqslim.html, 1997.Google Scholar
- Garland98.Garland, M., and Heckbert, P., "Simplifying Surfaces with Color and Texture using Quadric Error Metrics," IEEE Visualization '98 Proceedings, 263-269, 1998. Google ScholarDigital Library
- Gopi98.Gopi, M. and Manocha, D., "A Unified Approach for Simplifying Polygonal and Spline Models," IEEE Visualization "98 Proceedings, 271-278, 1998. Google ScholarDigital Library
- Guéziec95.Gutziec, A. "Surface Simplification with Variable Tolerance," Second Annual Intl. Symp. On Medical Robotics and Computer Assisted Surgery (MRCAS '95), 132-139, 1995.Google Scholar
- Hamann94.Hamann, B. "A Data Reduction Scheme for Triangulated Surfaces," Computer-Aided Geometric Design, 197-214, 1994. Google ScholarDigital Library
- He95.He, T., Hong, L., Kaufman, A., Varshney, A., and Wang, S. "Voxel-Based Object Simplification," IEEE Visualization '95 Proceedings, 296-303, 1995. Google ScholarDigital Library
- Heckbert94.Heckbert, P., and Garland, M. "Multiresolution Modeling for Fast Rendering," Graphics Interface "94 Proceedings, 43-50, 1994.Google Scholar
- Heckbert97.Heckbert, P., and Garland, M. "Survey of Polygonal Surface Simplification Algorithms," Draft of Carhegie Mellon University Computer Science Technical Report, 1997.Google Scholar
- Hoppe93.Hoppe, H., DePose, T., Duchamp, T., McDonald, J., and Stuetzle, W. "Mesh Optimization," Computer Graphics (SIGGRAPH '93 Proceedings), 19-26, 1993. Google ScholarDigital Library
- Hoppe96.Hoppe, H. "Progressive Meshes," Computer Graphics (SIGGRAPH '96 Proceedings), 99-108, 1996. Google ScholarDigital Library
- Hoppe97.Hoppe, H. "View-Dependent Refinement of Progressive Meshes," Computer Graphics (SIGGRAPH '97 Proceedings), 189-198, 1997. Google ScholarDigital Library
- Hoppe98.Hoppe, H. "Efficient Implementation of Progressive Meshes," Computers & Graphics Vol. 22 No. 1, 27-36, 1998.Google ScholarCross Ref
- Kobbelt98.Kobbelt, L., Campagna, S., and Seidel, H-P. "A General Framework for Mesh Decimation," Graphics Interface '98 Proceedings, 43-50, 1998.Google Scholar
- Lindstrom98.Lindstrom, P., and Turk,G. "Fast and Memory Efficient Polygonal Simplification," 1EEE Visualization "98 Proceedings, 279-286, 1998. Google ScholarDigital Library
- Low97.Low, K., and Tan, T. "Model Simplification Using Vertex-Clustering," Symposium on Interactive 3D Graphics '97 Proceedings, 75-82, 1997. Google ScholarDigital Library
- Luebke97.Luebke, D., and Erikson, C. "View-Dependent Simplification of Arbitrary Polygonal Environments," Computer Graphics (SIGGRAPH '97 Proceedings), 199- 208, 1997. Google ScholarDigital Library
- Popovic97.Popovic, J., and Hoppe, H. "Progressive Simplicial Complexes," Computer Graphics (SIGGRAPH '97 Proceedings), 217-224, 1997. Google ScholarDigital Library
- Ronfard96.Ronfard, R., and Rossignac, J. "Full-range Approximation of Triangulated Polyhedra," Computer Graphics Forum (Eurographics "96 Proceedings), 67- 76, 1996.Google Scholar
- Rossignac93.Rossignac, J., and Borrel, P. "Multi-Resolution 3D Approximations for Rendering Complex Scenes," Geometric Modeling in Computer Graphics, 455-465, 1993.Google ScholarCross Ref
- Schneider94.Schneider, B., Borrel, P., Menon, J., Mittleman, J., and Rossignac, J. "Brush as a Walkthrough System for Architectural Models," Fifth Eurographics Workshop on Rendering, 389-399, 1994.Google Scholar
- Schroeder92.Schroeder, W., Zarge, J., and Lorensen, W. "Decimation of Triangle Meshes," Computer Graphics (SIGGRAPH '92 Proceedings), 65-70, 1992. Google ScholarDigital Library
- Schroeder97.Schroeder, W. "A Topology Modifying Progressive Decimation Algorithm," IEEE Visualization '97 Proceedings, 205-212, 1997. Google ScholarDigital Library
- Turk92.Turk, G. "Re-Tiling Polygonal Surfaces," Computer Graphics (SIGGRAPH '92 Proceedings), 55-64, 1992. Google ScholarDigital Library
Index Terms
- GAPS: general and automatic polygonal simplification
Recommendations
Efficient representation and extraction of 2-manifold isosurfaces using kd-trees
Special issue on pacific graphics 2003In this paper, we propose the utilization of a kd-tree based hierarchy as an implicit object representation. Compared to an octree, the kd-tree based hierarchy is superior in terms of adaptation to the object surface. In consequence, we obtain ...
Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees
This paper introduces an efficient algorithm for computing the Reeb graph of a scalar function f defined on a volumetric mesh M in R^3. We introduce a procedure called "loop surgery" that transforms M into a mesh M' by a sequence of cuts and guarantees ...
Efficient Representation and Extraction of 2-Manifold Isosurfaces Using kd-Trees
PG '03: Proceedings of the 11th Pacific Conference on Computer Graphics and ApplicationsIn this paper, we propose the utilization of a kd-tree based hierarchy as an implicit object representation. Compared to an octree, the kd-tree based hierarchy is superior in terms of adaptation to the object surface. In consequence, we obtain ...
Comments