Advertisement

Abstract

Thinning algorithms are greedy point removal schemes for scattered data, where the points are recursively removed according to some specific removal criterion. This yields a hierarchy of the input data,which is used for building a multi resolution approximation of a model object,a mathematical function. In general, thinning algorithms are therefore useful tools for model simplification and data reduction.

Keywords

Voronoi Diagram Image Compression Delaunay Triangulation Point Pair Covering Radius 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Armin Iske
    • 1
  1. 1.Lehrstuhl Numerische Mathematik und Wissenschaftliches RechnenTechnische Universität MünchenGarchingGermany

Personalised recommendations