Abstract
AbstractCurve 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.KeywordsComputational GeometryCritical LineMatrix PolynomialGeneralize Eigenvalue ProblemCommon RootThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
