Topology of Families of Implicit Algebraic Surfaces Depending on a Parameter
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 (, , , ) the different shapes in the family can be computed. The algorithm is due to a generalization of the ideas in  to the surface case.
Unable to display preview. Download preview PDF.
- 1.Alberti, L., Mourrain, B., Tecourt, J.P.: Isotopic Triangulation of a Real Algebraic Surface. Journal of Symbolic Computation 44(9), 1291–1310 (2009)Google Scholar
- 3.Alcazar, J.G.: Applications of Level Curves to Some Problems on Algebraic Surfaces. In: Lambán, L., Romero, A., Rubio, J. (eds.) Contribuciones Científicas en honor de Mirian Andrés Gómez, pp. 105–122. Univ. La Rioja (2010)Google Scholar
- 7.Berberich, E., Kerber, M., Sagraloff, M.: An Efficient Algorithm for the Stratification and Triangulation of Algebraic Surfaces. Computational Geometry: Theory and Applications 43(3), 257–278 (2009); Special Issue on 24th Annual Symposium on Computational Geometry Google Scholar
- 11.Mourrain, B., Tecourt, J.P.: Isotopic Meshing of a Real Algebraic Surface, Rapport de recherche, n 5508. Unite de Recherche INRIA Sophia Antipolis (2005)Google Scholar
- 12.Winkler, F.: Polynomial Algorithms in Computer Algebra. Springer Verlag, ACM Press (1996)Google Scholar