Survey of Polygonal Surface Simplification Algorithms

Abstract

This paper surveys methods for simplifying and approximating polygonal surfaces. A polygonal surface is a piecewise-linear surface in 3-D defined by a set of polygons; typically a set of triangles. Methods from computer graphics, computer vision, cartography, computational geometry, and other fields are classified, summarized, and compared both practically and theoretically. The surface types range from height fields (bivariate functions), to manifolds, to non-manifold self-intersecting surfaces. Piecewise-linear curve simplification is also briefly surveyed.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1997
Accession Number
ADA461098

Entities

People

  • Michael Garland
  • Paul S. Heckbert

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Air Platforms
  • Biomedical
  • Energy and Power Technologies
  • Space

DTIC Thesaurus Topics

  • Algorithms
  • Computational Fluid Dynamics
  • Computational Science
  • Computer Graphics
  • Computer Programming
  • Computer Programs
  • Computer Vision
  • Computers
  • Finite Element Analysis
  • Geographic Information Systems
  • Geometry
  • Heuristic Methods
  • Image Processing
  • Pattern Recognition
  • Three Dimensional
  • Topology
  • Two Dimensional

Readers

  • Computer Vision.
  • Graph Algorithms and Convex Optimization.
  • Theoretical Analysis.

Technology Areas

  • AI & ML
  • AI & ML - Machine Learning Algorithms