scientific article; zbMATH DE number 5764874
From MaRDI portal
Publication:3579467
Cited in
(15)- A subdivision method for arrangement computation of semi-algebraic curves
- On the Complexity of Reliable Root Approximation
- On the complexity of computing the topology of real algebraic space curves
- An efficient algorithm for the stratification and triangulation of an algebraic surface
- A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces
- On the topology and isotopic meshing of plane algebraic curves
- On the complexity of computing with planar algebraic curves
- Arrangements on parametric surfaces. II: Concretizations and applications
- A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
- Arrangements on parametric surfaces. I: General framework and infrastructure
- On the topology of real algebraic plane curves
- Untangling planar curves
- An improved complexity bound for computing the topology of a real algebraic space curve
- Certified rational parametric approximation of real algebraic space curves with local generic position method
- Exact symbolic-numeric computation of planar algebraic curves
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579467)