Computing the topology of an arrangement of implicit and parametric curves given by values

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Curve arrangement studying is a subject of great interest in Computational Geometry and CAGD. In our paper, a new method for computing the topology of an arrangement of algebraic plane curves, defined by implicit and parametric equations, is presented. The polynomials appearing in the equations are given in the Lagrange basis, with respect to a suitable set of nodes. Our method is of sweep-line class, and its novelty consists in applying algebra by values for solving systems of two bivariate polynomial equations. Moreover, at our best knowledge, previous works on arrangements of curves consider only implicitly defined curves. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Caravantes, J., Fioravanti, M., Gonzalez-Vega, L., & Necula, I. (2014). Computing the topology of an arrangement of implicit and parametric curves given by values. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8660 LNCS, pp. 59–73). Springer Verlag. https://doi.org/10.1007/978-3-319-10515-4_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free