2007
DOI: 10.1007/s00607-006-0198-7
|View full text |Cite
|
Sign up to set email alerts
|

Multiresolution morphing for planar curves

Abstract: We present a multiresolution morphing algorithm using "as-rigidas-possible" shape interpolation combined with an angle-length based multiresolution decomposition of simple 2D piecewise curves. This novel multiresolution representation is defined intrinsically and has the advantage that the details' orientation follows any deformation naturally. The multiresolution morphing algorithm consists of transforming separately the coarse and detail coefficients of the multiresolution decomposition. Thus all LoD (level … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2008
2008
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 17 publications
0
8
0
Order By: Relevance
“…In what follows we have taken the digital contours Γ and ∆ to lie on the planes z = r Γ and z = r ∆ , with r Γ < r ∆ and the coefficient α in equation (15) to be equal to 0.1. The grids are relatively coarse, ranging from 50 ÷ 70 nodes in the x and y directions and 20 nodes in the z direction.…”
Section: Interpolating Two Polygons With C 0 Triangular Facet Surfacesmentioning
confidence: 99%
See 1 more Smart Citation
“…In what follows we have taken the digital contours Γ and ∆ to lie on the planes z = r Γ and z = r ∆ , with r Γ < r ∆ and the coefficient α in equation (15) to be equal to 0.1. The grids are relatively coarse, ranging from 50 ÷ 70 nodes in the x and y directions and 20 nodes in the z direction.…”
Section: Interpolating Two Polygons With C 0 Triangular Facet Surfacesmentioning
confidence: 99%
“…Considering the characteristics of the equation (9) we obtain that the absolute values of Ψ i,j,k decrease, as we move from the boundary to the zero-level set of Ψ , provided that the coefficient α is greater than zero, thus in each step we update the values of Ψ i,j,k on a narrow band of nodes, using the values of Ψ i,j,k that have already been calculated (solved), starting from the boundary of the domain, via equation (15). Then, we consider as solved the point, whose value is closest to solved points, i.e., the one with the maximum absolute value in the narrow band.…”
Section: Numerical Solution Of the Eikonal And The Transport Equationmentioning
confidence: 99%
“…In [46] a curvature-based MR representation for 2D polygonal curves was introduced. This MR representation is based on an intrinsic parameterization of both the coarse shape and the detail coefficients.…”
Section: Multiresolution Morphingmentioning
confidence: 99%
“…In the last decades, several works have been focusing on the construction of G 1 surfaces, including [CC78], [Pet95], [Loo94], [Rei95], [Pra97], [YZ04], [GHQ06], [HWW + 06], [FP08], [HBC08], [PF10], [BGN14], [BH14]. Some of these constructions use tensor product b-spline elements.…”
Section: Introductionmentioning
confidence: 99%
“…In [PF10], it is shown that bicubic G 1 splines with linear transition maps requires at least a 9-split of the parameter domains. In [HBC08], bicubic 4-split macro-patch elements are used. They are represented by 36 control coefficients.…”
Section: Introductionmentioning
confidence: 99%