Restricted mesh simplification using edge contractions
Andersson, Mattias LU ; Gudmundsson, Joachim and Levcopoulos, Christos LU
(2006)
12th Annual International Conference, COCOON 2006
4112.
p.196-204
- Abstract
- 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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/389647
- author
- Andersson, Mattias
LU
; Gudmundsson, Joachim
and Levcopoulos, Christos
LU
- organization
- publishing date
- 2006
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- Computing and combinatorics / Lecture notes in computer science
- volume
- 4112
- pages
- 196 - 204
- publisher
- Springer
- conference name
- 12th Annual International Conference, COCOON 2006
- conference location
- Taipei, Taiwan
- conference dates
- 2006-08-15 - 2006-08-18
- external identifiers
-
- wos:000240077300022
- scopus:33749543046
- ISSN
- 1611-3349
- 0302-9743
- ISBN
- 978-3-540-36925-7
- DOI
- 10.1007/11809678
- project
- VR 2005-4085
- language
- English
- LU publication?
- yes
- id
- 5324a312-af45-48ed-b005-9a518b00ceb0 (old id 389647)
- date added to LUP
- 2016-04-01 11:41:52
- date last changed
- 2024-10-08 06:26:05
@inproceedings{5324a312-af45-48ed-b005-9a518b00ceb0,
abstract = {{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.}},
author = {{Andersson, Mattias and Gudmundsson, Joachim and Levcopoulos, Christos}},
booktitle = {{Computing and combinatorics / Lecture notes in computer science}},
isbn = {{978-3-540-36925-7}},
issn = {{1611-3349}},
language = {{eng}},
pages = {{196--204}},
publisher = {{Springer}},
title = {{Restricted mesh simplification using edge contractions}},
url = {{http://dx.doi.org/10.1007/11809678}},
doi = {{10.1007/11809678}},
volume = {{4112}},
year = {{2006}},
}