Jonathan Cohen
Frederick Brooks
- 1.E Agarwal and S. Suri. Surface approximation and geometric partitions. In Proceedings Fifth Symposium on Discrete Algorithms, pages 24-33, 1994. Google Scholar
Digital Library
- 2.H. Br6nnimann and M. Goodrich. Almost optimal set covers in finite VC-dimension. In Proceedings Tenth ACM Symposium on Computational Geometry, pages 293-302,1994. Google ScholarDigital Library
- 3.K. L. Clarkson. Algorithms for polytope covering and approximation. In Proc. 3rd Workshop Algorithms Data Struct., Lecture Notes in Computer Science, 1993. Google ScholarDigital Library
- 4.M. Cosman and R. Schumacker. System strategies to optimize CIG image content. In Proceedings of the Image II Conference, Scottsdale, Arizona, June 10-12 1981.Google Scholar
- 5.G. Das and D. Joseph. The complexity of minimum convex nested polyhedra. In Proc. 2nd Canad. Conf. Comput. Geom., pages 296- 301, 1990.Google Scholar
- 6.M. J. DeHaemer, Jr. and M. J. Zyda. Simplification of objects rendered by polygonal approximations. Computers & Graphics, 15(2):175-184,1991.Google Scholar
- 7.T.D. DeRose, M. Lounsbery, and J. Warren. Multiresolution analysis for surface of arbitrary topological type. Report 93-10-05, Department of Computer Science, University of Washington, Seattle, WA, 1993.Google Scholar
- 8.M. Eck, T. DeRose, T. Duchamp, H. Hoppe, M. Lounsbery, and W. Stuetzle. Multiresolution analysis of arbitrary meshes. Computer Graphics: Proceedings of SIGGRAPH' 95, pages 173-182,1995. Google ScholarDigital Library
- 9.T.A. Funkhouser and C. H. S6quin. Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments. In Computer Graphics (SIGGRAPH '93 Proceedings), volume 27, pages 247-254, August 1993. Google ScholarDigital Library
- 10.N. Greene, M. Kass, and G. Miller. Hierarchical z-buffer visibility. In Computer Graphics: Proceedings of SIGGRAPH 1993, pages 231-238. ACM SIGGRAPH, 1993. Google ScholarDigital Library
- 11.T. He, L. Hong, A. Kaufman, A. Varshney, and S. Wang. Voxelbased object simplification. In G. M. Nielson and D. Silver, editors, IEEE Visualization '95 Proceedings, pages 296-303,1995. Google ScholarDigital Library
- 12.E Heckbert and M. Garland. Multiresolution modeling for fast rendering. Proceedings of Graphics Interface, 1994.Google Scholar
- 13.E Hinker and C. Hansen. Geometric optimization. In Gregory M. Nielson and Dan Bergeron, editors, Proceedings Visualization '93, pages 189-195, October 1993. Google ScholarDigital Library
- 14.H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, and W. Stuetzle. Mesh optimization. In James T. Kajiya, editor, Computer Graphics (SIGGRAPH '93 Proceedings), volume 27, pages 19-26, August 1993. Google ScholarDigital Library
- 15.A. D. Kalvin and R. H. Taylor. Superfaces: Polyhedral approximation with bounded error. Technical Report RC 19135 (#82286), IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY 10958, 1993.Google Scholar
- 16.J. Mitchell and S. Suri. Separation and approximation of polyhedral surfaces. In Proceedings of 3rd ACM-SIAM Symposium on Discrete Algorithms, pages 296-306,1992. Google ScholarDigital Library
- 17.Kevin J. Renze and J. H. Oliver. Generalized surface and volume decimation for unstructured tessellated domains. In Proceedings of SIVE' 95, 1995. Google ScholarDigital Library
- 18.J. Rossignac and E Borrel. Multi-resolution 3D approximations for rendering. In Modeling in Computer Graphics, pages 455-465. Springer-Verlag, June-July 1993.Google ScholarCross Ref
- 19.H.E. Rushmeier, C. Patterson, and A. Veerasamy. Geometric simplification for indirect illumination calculations. In Proceedings Graphics Interface '93, pages 227-236,1993.Google Scholar
- 20.E J. Schmitt, B. A. Barsky, and W. Du. An adaptive subdivision method for surface-fitting from sampled data. Computer Graphics (SIGGRAPH '86 Proceedings), 20(4): 179-188,1986. Google ScholarDigital Library
- 21.W. J. Schroeder, J. A. Zarge, and W. E. Lorensen. Decimation of triangle meshes. In Edwin E. Catmull, editor, Computer Graphics (SIGGRAPH '92 Proceedings), volume 26, pages 65-70, July 1992. Google ScholarDigital Library
- 22.G. Taubin. A signal processing approach to fair surface design. In Proc. of ACM Siggraph, pages 351-358,1995. Google ScholarDigital Library
- 23.G. Turk. Re-filing polygonal surfaces. In Computer Graphics (SIG- GRAPH '92 Proceedings), volume 26, pages 55-64, July 1992. Google ScholarDigital Library
- 24.A. Varshney. Hierarchical geometric approximations. Ph.D. Thesis TR-050-1994, Department of Computer Science, University of North Carolina, Chapel Hill, NC 27599-3175,1994. Google ScholarDigital Library
Index Terms
- Simplification envelopes
Recommendations
Topology Simplification for Polygonal Virtual Environments
We present a topology simplifying approach that can be used for genus reductions, removal of protuberances, and repair of cracks in polygonal models in a unified framework. Our work is complementary to the existing work on geometry simplification of ...
Carving for topology simplification of polygonal meshes
The topological complexity of polygonal meshes has a large impact on the performance of various geometric processing algorithms, such as rendering and collision detection algorithms. Several approaches for simplifying topology have been discussed in the ...
Subdivision Surface Fitting Using QEM-Based Mesh Simplification and Reconstruction of Approximated B-Spline Surfaces
PG '00: Proceedings of the 8th Pacific Conference on Computer Graphics and ApplicationsWe present a general method for automatically reconstructing a network of B-spline patches based on the Doo-Sabin subdivision surface. This method consists of two parts, surface fitting and surface construction. In surface fitting, mesh simplification ...
Comments