Michael Garland
Andrew Willmott
- 1.Michael R. Anderberg. Cluster Analysis for Applications. Academic Press, New York, 1973.Google Scholar
- 2.James Arvo and David Kirk. A survey of ray racing acceleration techniques.In AndrewGlassner,editor,An Introduction to Ray Tracing ,pages 201-262.Academic Press,1989. Google ScholarDigital Library
- 3.Dana H. Ballard. Strip trees:A hierarchical represen ation for curves.Communications of the ACM , 24(5):310-321,1981. Google ScholarDigital Library
- 4.Gill Barequet, Bernard Chazelle, Leonidas J. Guibas, Joseph S. B. Mitchell, and Ayellet Tal. BOXTREE:A hierarchical representation for surfaces in 3D.Computer Graphics Forum ,15(3):387-96, 484, 1996.Google ScholarCross Ref
- 5.Jens Berkmann and Terry Caelli. Computation of surface geometry and segmentation using covariance echniques. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(11):1114-1116, 1994. Google ScholarDigital Library
- 6.Herve Delingette. Simplex meshes:A general represen ation for 3D shape reconstruction.In Conf. on Computer Vision and Pattern Recognition (CVPR '94), June 1994.Google Scholar
- 7.Tony DeRose, Michael Kass, and Tien Truong. Subdivision surfaces in character animation. In Proceedings SIGGRAPH 98, pages 85-94, 1998. Google ScholarDigital Library
- 8.O. D. Faugeras and M. Hebert. The representation, recognition, and positioning of 3-D shapes from range data.In Takeo Kanade,editor,Three-Dimensional Machine Vision, pages 301-353. Kluwer Academic Publishers, 1987.Google Scholar
- 9.Michael Garland. Multiresolution modeling: Survey & future opportunities.In State of the Art Report,pages 111-131. Eurographics, September 1999. http://www. uiuc.edu/~garland/papers.htmlGoogle Scholar
- 10.Michael Garland. Quadric-Based Polygonal Surface Simplification. PhD thesis, Carnegie Mellon University, CS Dept., 1999. Tech. Rept. CMU-CS-99-105. http://www.uiuc.edu/~garland/research/thesis.html Google ScholarDigital Library
- 11.Michael Garland and Paul S. Heckbert. Surface simplification using quadric error metrics.In SIGGRAPH 97 Proc., pages 209-216, August 1997. http://www.uiuc. edu/~garland/research/quadrics.html Google ScholarDigital Library
- 12.S. Gottschalk, M. C. Lin, and D. Manocha. OBB Tree: A hierarchical structure for rapid in erference detection. In Proceedings SIGGRAPH 96,pages 171-180, 1996. Google ScholarDigital Library
- 13.Pa Hanrahan, David Salzman, and Larry Aupperle. A rapid hierarchical radiosity algorithm. Computer Graphics (SIGGRAPH '91 Proc.),25(4):197-206, July 1991. Google ScholarDigital Library
- 14.Hugues Hoppe. Progressive meshes. In SIGGRAPH '96 Proc.,pages 99 -108,August 1996.http://research. microsoft.com/~hoppe/. Google ScholarDigital Library
- 15.Hugues Hoppe. View-dependen renemen of progressive meshes.In SIGGRAPH 97 Proc., pages 189-198, August 1997.http://research.microsoft.com/~hoppe/. Google ScholarDigital Library
- 16.Hugues Hoppe, Tony DeRose, Tom Duchamp, John Mc- Donald, and Werner Stuetzle. Surface reconstruction from unorganized points. In Computer Graphics (SIG- GRAPH '92 Proceedings),volume 26,pages 71-78, July 1992.http://research.microsoft.com/~hoppe/. Google ScholarDigital Library
- 17.Anil K. Jain. Fundamentals of Digital Image Processing. Prentice-Hall International, London, 1989. Google ScholarDigital Library
- 18.I. T. Jolliffe. Principal Component Analysis. Springer- Verlag, New York, 1986.Google ScholarCross Ref
- 19.Alan D. Kalvin and Russell H. Taylor. Superfaces: Polygonal mesh simplification with bounded error. IEEE Computer Graphics and Appl., 16(3), May 1996. http://www.computer.org/pubs/cg&a/articles/ g30064.pdf Google ScholarDigital Library
- 20.Leif Kobbelt, Swen Campagna, Jens Vorsatz, and Hans- Peter Seidel. Interactive multi-resolution modeling on arbitrary meshes. In Proc. SIGGRAPH 98, pages 105 - 114, 1998. Google ScholarDigital Library
- 21.Aaron W. F. Lee, Wim Sweldens, Peter Schr~der, Lawrence Cowsar, and David Dobkin. MAPS: Multiresolution adaptive parameterization of surfaces. In Proc. SIGGRAPH 98, pages 95-104, 1998. Google ScholarDigital Library
- 22.Ping Liang and John S. Todhunter. Representation and recognition of surface shapes in range images: A differential geometry approach. Computer Vision, Graphics, and Image Processing, 52:78-109, 1990. Google ScholarDigital Library
- 23.David Luebke and Carl Erikson. View-dependent simplification of arbitrary polygonal environments. In SIG- GRAPH 97 Proc., pages 199-208, August 1997. Google ScholarDigital Library
- 24.Richard G. Niemi, Bernard Grofman, Carl Carlucci, and Thomas Hofeller. Measuring compactness and the role of a compactness standard in a test for partisan and racial gerrymandering. Journal of Politics, 52(4):1155- 1181, 1990.Google ScholarCross Ref
- 25.Franco P. Preparata and Michael I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, New York, NY, 1985. Google ScholarDigital Library
- 26.William H. Press, Saul A. Teukolsky, William T. Vetterling, and Brian P. Flannery. Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, Second edition, 1992. http://www.nr.com Google ScholarDigital Library
- 27.Hanan Samet. Applications of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990. Google ScholarDigital Library
- 28.Brian Smits, James Arvo, and Donald Greenberg. A clustering algorithm for radiosity in complex environments. In Proceedings of SIGGRAPH '94, pages 435- 442, July 1994. Google ScholarDigital Library
- 29.Dieter Willersinn and Walter G. Kropatsch. Dual graph contraction for irregular pyramids. In Proc. 12th IAPR Intl. Conf. on Pattern Recognition, volume III, pages 251-256, October 1994.Google ScholarCross Ref
- 30.Andrew J. Willmott, Paul S. Heckbert, and Michael Garland. Face cluster radiosity. In Eurographics Workshop on Rendering, June 1999. http://www.cs.cmu.edu/ ~ajw/paper/fcr-eg99/. Google ScholarDigital Library
- 31.Julie C. Xia and Amitabh Varshney. Dynamic viewdependent simplification for polygonal models. In Proceedings of Visualization '96, pages 327-334, October 1996. Google ScholarDigital Library
Index Terms
- Hierarchical face clustering on polygonal surfaces
Recommendations
Robust Creation of Implicit Surfaces from Polygonal Meshes
Implicit surfaces are used for a number of tasks in computer graphics, including modeling soft or organic objects, morphing, collision detection, and constructive solid geometry. Although operating on implicit surfaces is usually straightforward, ...
A New Mesh Simplification Algorithm Based on Quadric Error Metrics
ICACTE '08: Proceedings of the 2008 International Conference on Advanced Computer Theory and EngineeringThis paper proposes a mesh simplification algorithm base on quadric error metric. Most of the simplification algorithms use the geometric distance as their simplification criteria, the distance metric is very efficient to measure geometric error, but it ...
Semi-supervised Hierarchical Clustering
ICDM '11: Proceedings of the 2011 IEEE 11th International Conference on Data MiningSemi-supervised clustering (i.e., clustering with knowledge-based constraints) has emerged as an important variant of the traditional clustering paradigms. However, most existing semi-supervised clustering algorithms are designed for partitional ...
Comments