Improved projection for cylindrical algebraic decomposition
Journal of Symbolic Computation
Polynomial Algorithms in Computer Algebra
Polynomial Algorithms in Computer Algebra
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
A delineability-based method for computing critical sets of algebraic surfaces
Journal of Symbolic Computation
Computer Aided Geometric Design
Isotopic triangulation of a real algebraic surface
Journal of Symbolic Computation
An efficient algorithm for the stratification and triangulation of an algebraic surface
Computational Geometry: Theory and Applications
On the different shapes arising in a family of plane rational curves depending on a parameter
Computer Aided Geometric Design
Hi-index | 0.00 |
Given a family of algebraic surfaces, implicitly defined, depending on a parameter t, here we provide an algorithm for computing the different shapes arising in the family. The algorithm decomposes the real line into finitely many pieces (points and intervals) so that over each interval the shape is invariant, in the sense that the topology of the family can be described by means of the same simplicial complex. As a consequence, by applying known algorithms ([1], [6], [7], [11]) the different shapes in the family can be computed. The algorithm is due to a generalization of the ideas in [2] to the surface case.