2009
DOI: 10.1111/j.1467-8659.2009.01395.x
|View full text |Cite
|
Sign up to set email alerts
|

Positional, Metric, and Curvature Control for Constraint‐Based Surface Deformation

Abstract: We present a geometry processing framework that allows direct manipulation or preservation of positional, metric, and curvature constraints anywhere on the surface of a geometric model. Target values for these properties can be specified point-wise or as integrated quantities over curves and surface patches embedded in the shape. For example, the user can draw several curves on the surface and specify desired target lengths, manipulate the normal curvature along these curves, or modify the area or principal cu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
8
1
1

Relationship

1
9

Authors

Journals

citations
Cited by 32 publications
(21 citation statements)
references
References 34 publications
0
21
0
Order By: Relevance
“…These possess complex geometric properties in common, but their variability cannot be reduced to perturbations of a template shape parameterised by a few quantities. [26][27][28][29] In this paper, we provide implicit formulae to recover the structure of a point cloud using overparameterised method. We conclude the paper providing experimental results, for both synthetic and real models evaluating the performance of the techniques and showing the feasibility of the approach.…”
Section: Related Workmentioning
confidence: 99%
“…These possess complex geometric properties in common, but their variability cannot be reduced to perturbations of a template shape parameterised by a few quantities. [26][27][28][29] In this paper, we provide implicit formulae to recover the structure of a point cloud using overparameterised method. We conclude the paper providing experimental results, for both synthetic and real models evaluating the performance of the techniques and showing the feasibility of the approach.…”
Section: Related Workmentioning
confidence: 99%
“…Note that this technique cannot only be used for the efficient computation of volume constraints. It can also be employed for other constraints that depend on a large number of mesh vertices, such as, for instance, constraining the area of a large surface patch in the framework of [EP09]. We remark that there are several ways to compute a factorization of a matrix with dense rows through matrix updates.…”
Section: Numerical Minimizationmentioning
confidence: 99%
“…Our implementation of [EP09] cannot generate results with such strictly preserved metrics -see the comparison shown in Fig.8. All examples show less than 1% of error on different types of metrics.…”
Section: Validation and Comparisonmentioning
confidence: 99%