2010
DOI: 10.1007/978-3-642-11620-9_3
View full text |Buy / Rent full text
|
Sign up to set email alerts
|

Abstract: Abstract. We present an algorithm generating a collection of fat arcs which bound the zero set of a given bivariate polynomial in BernsteinBézier representation. We demonstrate the performance of the algorithm (in particular the convergence rate) and we apply the results to the computation of intersection curves between implicitly defined algebraic surfaces and rational parametric surfaces.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2011
2011

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 18 publications
(1 reference statement)
0
1
0
Order By: Relevance
“…In the future, we intend to use algebraic methods to compute the complex solutions for Sing(C) as proposed in [7]. We also mention the work in progress in the same direction of research done in parallel by [4], and by [25]. Further work in this direction is still required so that we can use these methods for our systems.…”
Section: Computing the Singularities Of The Algebraic Curvementioning
confidence: 99%
“…In the future, we intend to use algebraic methods to compute the complex solutions for Sing(C) as proposed in [7]. We also mention the work in progress in the same direction of research done in parallel by [4], and by [25]. Further work in this direction is still required so that we can use these methods for our systems.…”
Section: Computing the Singularities Of The Algebraic Curvementioning
confidence: 99%