A Subdivision Method for Arrangement Computation of Semi-Algebraic Curves

DOI10.1007/978-1-4419-0999-2_7zbMath1191.68890OpenAlexW946326044MaRDI QIDQ5188772

Mourrain, Bernard, Julien Wintz

Publication date: 5 March 2010

Published in: Nonlinear Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4419-0999-2_7

zbMATH Keywords

topologymathematical softwarearrangementintersectionsymbolic-numeric computationpolynomial solvers

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Semialgebraic sets and related spaces (14P10) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (1)

Smooth parametrizations in dynamics, analysis, diophantine and computational geometry

Cites Work

• On the computation of an arrangement of quadrics in 3D
• Subdivision methods for solving polynomial equations
• Computation of the solutions of nonlinear polynomial systems
• Investigation of a subdivision based algorithm for solving systems of polynomial equations.
• Algorithms for Reporting and Counting Geometric Intersections
• Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
• Algorithms - ESA 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Subdivision Method for Arrangement Computation of Semi-Algebraic Curves