Arrangement computation for planar algebraic curves

DOI10.1145/2331684.2331698zbMath1345.68259arXiv1103.4697OpenAlexW1531393591MaRDI QIDQ2819621

Michael Sagraloff, Eric Berberich, Pavel Emeliyanenko, Alexander Kobel

Publication date: 29 September 2016

Published in: Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1103.4697

zbMATH Keywords

arrangementstopologyalgebraic curvescertified algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects of algebraic curves (14Q05)

Related Items (max. 100)

On the complexity of computing the topology of real algebraic space curves ⋮ Computing the topology of a plane or space hyperelliptic curve ⋮ On the topology and isotopic meshing of plane algebraic curves ⋮ Exact symbolic-numeric computation of planar algebraic curves ⋮ Homeomorphic approximation of the intersection curve of two rational surfaces ⋮ A worst-case bound for topology computation of algebraic curves

Uses Software

• CGAL

This page was built for publication: Arrangement computation for planar algebraic curves