Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Restricted mesh simplification using edge contractions

Publiceringsår: 2006
Språk: Engelska
Sidor: 196-204
Publikation/Tidskrift/Serie: Computing and combinatorics / Lecture notes in computer science
Volym: 4112
Dokumenttyp: Konferensbidrag
Förlag: Springer


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.


  • Computer Science


12th Annual International Conference, COCOON 2006
  • VR 2005-4085
  • ISSN: 0302-9743
  • ISSN: 1611-3349
  • ISBN: 978-3-540-36925-7

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen