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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Andersson, M., Gudmundsson, J., & Levcopoulos, C. (2006). Restricted mesh Simplification using edge contractions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4112 LNCS, pp. 196–204). Springer Verlag. https://doi.org/10.1007/11809678_22
Mendeley helps you to discover research relevant for your work.