The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Restricted mesh simplification using edge contractions

Author

Summary, in English

We consider the problem of simplifying a triangle mesh using edge contractions, under the restriction that the resulting vertices must be a subset of the input set. That is, contraction of an edge must be made onto one of its adjacent vertices. In order to maintain a high number of contractible edges under this restriction, a small modification of the mesh around the edge to be contracted is allowed. Such a contraction is denoted a 2-step contraction. Given m "important" points or edges it is shown that a simplification hierarchy of size O(n) and depth O(log(n/m)) may be constructed in O(n) time. Further, for many edges not even 2-step contractions may be enough, and thus, the concept is generalized to k-step contractions.

Department/s

  • Computer Science

Publishing year

2006

Language

English

Pages

196-204

Publication/Series

Computing and combinatorics / Lecture notes in computer science

Volume

4112

Document type

Conference paper

Publisher

Springer

Topic

  • Computer Science

Conference name

12th Annual International Conference, COCOON 2006

Conference date

2006-08-15 - 2006-08-18

Conference place

Taipei, Taiwan

Status

Published

Project

  • VR 2005-4085

ISBN/ISSN/Other

  • ISSN: 1611-3349
  • ISSN: 0302-9743
  • ISBN: 978-3-540-36925-7