Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alberti, L., Mourrain, B., Tecourt, J.P.: Isotopic Triangulation of a Real Algebraic Surface. Journal of Symbolic Computation 44(9), 1291–1310 (2009)
Alcazar, J.G., Schicho, J., Sendra, R.: A Delineability-based Method for Computing Critical Sets of Algebraic Surfaces. Journal of Symbolic Computation 42, 678–691 (2007)
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)
Alcazar, J.G.: On the Different Shapes Arising in a Family of Rational Curves Depending on a Parameter. Computer Aided Geometric Design 27(2), 162–178 (2009)
Basu, S., Pollack, R., Roy, M.F.: Algorithms in Real Algebraic Geometry. Springer, Heidelberg (2003)
Berberich, E., Sagraloff, M.: A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces. Computer Aided Geometric Design 26(6), 627–647 (2009)
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
Brown, C.W.: Improved Projection for Cylindrical Algebraic Decomposition. Journal of Symbolic Computation 32(5), 447–465 (2001)
Cox, D., Little, J., O’Shea, D.: Ideals, Varieties and Algorithms. Springer, Heidelberg (1992)
MacCallum, S.: An Improved Projection Operation for Cylindrical Algebraic Decomposition. In: Caviness, B.F., Johnson, J.R. (eds.) Quantifier Elimination and Cylindrical Algebraic Decomposition, pp. 242–268. Springer, Heidelberg (1998)
Mourrain, B., Tecourt, J.P.: Isotopic Meshing of a Real Algebraic Surface, Rapport de recherche, n 5508. Unite de Recherche INRIA Sophia Antipolis (2005)
Winkler, F.: Polynomial Algorithms in Computer Algebra. Springer Verlag, ACM Press (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alcázar, J.G. (2011). Topology of Families of Implicit Algebraic Surfaces Depending on a Parameter. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2011. Lecture Notes in Computer Science, vol 6885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23568-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-23568-9_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23567-2
Online ISBN: 978-3-642-23568-9
eBook Packages: Computer ScienceComputer Science (R0)