2008
DOI: 10.1016/j.cagd.2008.06.009
|View full text |Cite
|
Sign up to set email alerts
|

Topology and arrangement computation of semi-algebraic planar curves

Abstract: We describe a new subdivision method to efficiently compute the topology and the arrangement of implicit planar curves. We emphasize that the output topology and arrangement are guaranteed to be correct. Although we focus on the implicit case, the algorithm can also treat parametric or piecewise linear curves without much additional work and no theoretical difficulties.The method isolates singular points from regular parts and deals with them independently. The topology near singular points is guaranteed throu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
50
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 47 publications
(50 citation statements)
references
References 34 publications
0
50
0
Order By: Relevance
“…For singular points, we solve the system of singular points with additional constraints. Note that the overall method to compute the topology at critical points is not new, it is described in full details in [49], see also for example [1,4,10,33,40,41] for closely related approaches for curves in non-generic position. The novelty appears in the way we compute multiplicities in this context; once again we avoid computing sub-resultant sequences.…”
Section: Our Contributionsmentioning
confidence: 99%
See 4 more Smart Citations
“…For singular points, we solve the system of singular points with additional constraints. Note that the overall method to compute the topology at critical points is not new, it is described in full details in [49], see also for example [1,4,10,33,40,41] for closely related approaches for curves in non-generic position. The novelty appears in the way we compute multiplicities in this context; once again we avoid computing sub-resultant sequences.…”
Section: Our Contributionsmentioning
confidence: 99%
“…, x n ] which is injective on V (I ); γ is called the separating polynomial of the RUR. 4 Note that a random degree-one polynomial in x 1 , . .…”
Section: Rational Univariate Representationmentioning
confidence: 99%
See 3 more Smart Citations