“Fast polygonal simplification with vertex-cluster trees” by Mittleman and Menon – ACM SIGGRAPH HISTORY ARCHIVES

“Fast polygonal simplification with vertex-cluster trees” by Mittleman and Menon

  • ©

Conference:


Type(s):


Interest Area:


    Big Data and Technical

Title:

    Fast polygonal simplification with vertex-cluster trees

Session/Category Title:   Level of Detail


Presenter(s)/Author(s):



Abstract:


    A new data structure and algorithm for fast computation of static levels of detail, using vertex clustering and allowing adaptive simplification based on various geometric and topological criteria.

References:


    1 Multi-Resolution 3D Approximations for Rendering Complex Scenes. Modeling in Computer Graphics, B. Falcidieno and T. L Kunii, Eds., Springer-Verlag, pp.455-465, 1993.


ACM Digital Library Publication:



Overview Page:



Submit a story:

If you would like to submit a story about this presentation, please contact us: historyarchives@siggraph.org