2015
DOI: 10.1016/j.cam.2014.09.012
|View full text |Cite
|
Sign up to set email alerts
|

Numerical proper reparametrization of parametric plane curves

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
20
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(20 citation statements)
references
References 31 publications
0
20
0
Order By: Relevance
“…[7,[14][15][16][17]20]). More precisely, in approximate parametrization problems, the Hausdorff distance is an essential tool for measuring the resemblance between the input and the output curves (which could not be bounded).…”
Section: Discussionmentioning
confidence: 97%
See 4 more Smart Citations
“…[7,[14][15][16][17]20]). More precisely, in approximate parametrization problems, the Hausdorff distance is an essential tool for measuring the resemblance between the input and the output curves (which could not be bounded).…”
Section: Discussionmentioning
confidence: 97%
“…This parametrization is ''almost'' improper (see Section 3 in [17]). The algorithm presented in [17] returns the curve C defined by the parametrization P (s) = (p 1 (s)/q 1 (s), p 2 (s)/q 2 (s)), where p 1 (s) = −60688159524533550201(20s 2 − 2s − 1), q 1 (s) = 60688159524533550201s 3 − 18449333330658180s 2 + 60081278530101s − 265814138756, p 2 (s) = 10975164641(1105s 2 + 1104s − 368), q 2 (s) = 92(21953640540s 2 + 21950329282s − 21975135).…”
Section: Example 52mentioning
confidence: 98%
See 3 more Smart Citations