Daniel A. Brake
Skip Abstract Section
Skip Supplemental Material SectionAbstract
Bertini_real is a compiled command line program for numerically decomposing the real portion of a positive-dimensional complex component of an algebraic set. The software uses homotopy continuation to solve a series of systems via regeneration from a witness set to compute a cell decomposition. The implemented decomposition algorithms are similar to the well-known cylindrical algebraic decomposition (CAD) first established by Collins in that they produce a set of connected cells. In contrast to the CAD, Bertini_real produces cells with midpoints connected to boundary points by homotopies, which can easily be numerically tracked. Furthermore, the implemented decomposition for surfaces naturally yields a triangulation. This CAD-like decomposition captures the topological information and permits further computation on the real sets, such as sampling, visualization, and three-dimensional printing.
Supplemental Material
Available for Download
zip
976.zip (6.1 MB)
Software for Bertini_real: Numerical Decomposition of Real Algebraic Curves and Surfaces
- L. Alberti, G. Comte, and B. Mourrain. 2005. Meshing implicit algebraic surfaces: The smooth case. In Mathematical Methods for Curves and Surfaces. Tromso, 4, 11--26.Google Scholar
- H. Alt. 1923. Über die Erzeugung gegebener ebener Kurven mit Hilfe des Gelenkvierecks. Zeitschr. Angew. Math. Mech. 3, 1 (1923), 13--19. Google ScholarCross Ref
- A. Appel. 1968. Some techniques for shading machine renderings of solids. In Proceedings of the 1968 Spring Joint Computer Conference (AFIPS’68). ACM, New York, NY, 37--45. Google ScholarDigital Library
- D. S. Arnon, G. E. Collins, and S. McCallum. 1984. Cylindrical algebraic decomposition I: The basic algorithm. SIAM J. Comput. 13, 4 (1984), 865--877. Google ScholarDigital Library
- S. Basu, R. Pollack, and M.-F. Roy. 2006. Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics). Springer-Verlag New York, Inc., Secaucus, NJ, USA.Google Scholar
- D. J. Bates, D. A. Brake, J. D. Hauenstein, A. J. Sommese, and C. W. Wampler. 2014b. Homotopies for connected components applied to computing critical sets. Retrieved from www.nd.edu/∼jhauenst/preprints/bbhswCritical.pdf.Google Scholar
- D. J. Bates, D. A. Brake, J. D. Hauenstein, A. J. Sommese, and C. W. Wampler. 2014a. On Computing a cell decomposition of a real surface containing infinitely many singularities. In Proceedings of the International Conference on Mathematical Software (ICMS’14), Hoon Hong and Chee Yap (Eds.). Lecture Notes in Computer Science, Vol. 8592. Springer, 246--252. Google ScholarCross Ref
- D. J. Bates, J. D. Hauenstein, C. Peterson, and A. J. Sommese. 2009b. Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials. In Approximate Commutative Algebra. Springer, NewYork, 55--77. Google ScholarCross Ref
- D. J. Bates, J. D. Hauenstein, C. Peterson, and A. J. Sommese. 2009a. A numerical local dimensions test for points on the solution set of a system of polynomial equations. SIAM J. Numer. Anal. 47, 5 (2009), 3608--3623. Google ScholarDigital Library
- D. J. Bates, J. D. Hauenstein, and A. J. Sommese. 2011. Efficient path tracking methods. Numer. Algor. 58, 4 (2011), 451--459. Google ScholarDigital Library
- D. J. Bates, J. D. Hauenstein, A. J. Sommese, and C. W. Wampler. 2013. Numerically Solving Polynomial Systems with Bertini. Vol. 25. SIAM.Google Scholar
- D. J. Bates, J. D. Hauenstein, A. J. Sommese, and C. W. Wampler. 2006. Bertini: Software for Numerical Algebraic Geometry. Retrieved from bertini.nd.edu.Google Scholar
- E. Berberich, P. Emeliyanenko, A. Kobel, and M. Sagraloff. 2013. Exact symbolic--numeric computation of planar algebraic curves. Theor. Comput. Sci. 491 (2013), 1--32. Google ScholarDigital Library
- E. Berberich, M. Kerber, and M. Sagraloff. 2008. Exact geometric-topological analysis of algebraic surfaces. In Proceedings of the 24th Annual Symposium on Computational Geometry (SCG’08). ACM, New York, NY, 164--173. DOI:http://dx.doi.org/10.1145/1377676.1377703 Google ScholarDigital Library
- E. Berberich, M. Kerber, and M. Sagraloff. 2010. An efficient algorithm for the stratification and triangulation of an algebraic surface. Comput. Geom. Theory Appl. 43, 3 (April 2010), 257--278. Google ScholarDigital Library
- G. M. Besana, S. Di Rocco, J. D. Hauenstein, A. J. Sommese, and C. W. Wampler. 2013. Cell decomposition of almost smooth real algebraic surfaces. Numer. Algor. 63, 4 (2013), 645--678. Google ScholarDigital Library
- O. Bottema and B. Roth. 1979. Theoretical Kinematics. North-Holland Series in Applied Mathematics and Mechanics, Vol. 24. North-Holland Publishing Co., Amsterdam. xiv+558 pages. Reprinted by Dover Publications, New York, 1990.Google Scholar
- D. A. Brake, D. J. Bates, W. Hao, J. D. Hauenstein, A. J. Sommese, and C. W. Wampler. 2014. Bertini_real: Software for one- and two-dimensional real algebraic sets. In Proceedings of the International Conference on Mathematical Software (ICMS’14), Hoon Hong and Chee Yap (Eds.). Lecture Notes in Computer Science, Vol. 8592. Springer, 175--182. Google ScholarCross Ref
- D. A. Brake, J. D. Hauenstein, A. P. Murray, D. H. Myszka, and C. W. Wampler. 2016. The complete solution of alt-burmester synthesis problems for four-bar linkages. J. Mech. Robot. 8, 4 (2016), 041018. Google ScholarCross Ref
- L. E. H. Burmester. 1888. Lehrbuch der Kinematik. Leipzig A. Felix.Google Scholar
- J. Cheng, S. Lazard, L. Peñaranda, M. Pouget, F. Rouillier, and E. Tsigaridas. 2010. On the topology of real algebraic plane curves. Math. Comput. Sci. 4, 1 (2010), 113--137. Google ScholarCross Ref
- L. P. Chew. 1993. Guaranteed-quality mesh generation for curved surfaces. In Proceedings of the 9th Annual Symposium on Computational Geometry. ACM, 274--280. Google ScholarDigital Library
- G. E. Collins. 1975. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. Lec. Notes Comp. Sci. 33 (1975), 134--183. Google ScholarCross Ref
- D. N. Daouda, B. Mourrain, and O. Ruatta. 2008. On the computation of the topology of a non-reduced implicit space curve. In Proceedings of the Twenty-first International Symposium on Symbolic and Algebraic Computation. ACM, 47--54. Google ScholarDigital Library
- T. K. Dey and T. Ray. 2010. Polygonal surface remeshing with Delaunay refinement. Eng. Comput. 26, 3 (2010), 289--301. Google ScholarDigital Library
- D. N. Diatta, B. Mourrain, and O. Ruatta. 2012. On the isotopic meshing of an algebraic implicit surface. J. Symbol. Comput. 47, 8 (2012), 903--925. Google ScholarDigital Library
- The Blender Foundation. 2014. Blender. Retrieved from www.blender.org.Google Scholar
- A. S. Glassner (Ed.). 1989. An Introduction to Ray Tracing. Academic Press Ltd., London, UK.Google Scholar
- J. D. Hauenstein, A. J. Sommese, and C. W. Wampler. 2011. Regeneration homotopies for solving systems of polynomials. Math. Comp. 80, 273 (2011), 345--377. Google ScholarCross Ref
- J. D. Hauenstein and C. W. Wampler. 2013a. Isosingular sets and deflation. Found. Comput. Math. 13, 3 (2013), 371--403. Google ScholarDigital Library
- J. D. Hauenstein and C. W. Wampler. 2013b. Numerically intersecting algebraic varieties via witness sets. Appl. Math. Comput. 219, 10 (2013), 5730--5742. Google ScholarDigital Library
- J. D. Hauenstein and C. W. Wampler. 2014. Unification and extension of intersection algorithms in numerical algebraic geometry. Retrieved from www.nd.edu/∼jdhauens/preprints/hwGeneralIntersection.pdf.Google Scholar
- H. Hauser and J. Schicho. 2014. Algebraic Surfaces. Retrieved from homepage.univie.ac.at/herwig.hauser/bildergalerie/gallery.html.Google Scholar
- M. L. Husty and A. Karger. 2000. Self-motions of Griffis-Duffy type parallel manipulators. In Proceedings of the 2000 IEEE Int. Conf. Robotics and Automation, CDROM, San Francisco, CA, April 24--28, 2000. IEEE. Google ScholarCross Ref
- M. Kerber and M. Sagraloff. 2012. A worst-case bound for topology computation of algebraic curves. J. Symbol. Comput. 47, 3 (2012), 239--258. Google ScholarDigital Library
- Y. Lu, D. J. Bates, A. J. Sommese, and C. W. Wampler. 2007. Finding all real points of a complex curve. Contemp. Math. 448 (2007), 183--205. Google ScholarCross Ref
- A. Paiva, H. Lopes, T. Lewiner, and L. H. de Figueiredo. 2006. Robust adaptive meshes for implicit surfaces. In XIX Brazilian Symposium on Computer Graphics and Image Processing (Sibgrapi’06). IEEE, Manaus, AM, 205--212. Google ScholarCross Ref
- A. J. Sommese, J. Verschelde, and C. W. Wampler. 2001. Numerical decomposition of the solution sets of polynomial systems into irreducible components. SIAM J. Numer. Anal. 38, 6 (2001), 2022--2046. Google ScholarDigital Library
- A. J. Sommese, J. Verschelde, and C. W. Wampler. 2004a. Advances in polynomial continuation for solving problems in kinematics. ASME J. Mech. Design 126, 2 (2004), 262--268. Google ScholarCross Ref
- A. J. Sommese, J. Verschelde, and C. W. Wampler. 2004b. Homotopies for intersecting solution components of polynomial systems. SIAM J. Numer. Anal. 42, 4 (2004), 1552--1571. Google ScholarDigital Library
- A. J. Sommese and C. W. Wampler. 2005. The Numerical Solution to Systems of Polynomials Arising in Engineering and Science. World Scientific, Singapore. Google ScholarCross Ref
- The CGAL Project. 2014. CGAL User and Reference Manual (4.4 ed.). CGAL Editorial Board. Retrieved from doc.cgal.org/4.4/Manual/packages.html.Google Scholar
- Y. Tong. 2013. Four-bar Linkage Synthesis for a Combination of Motion and Path-point Generation.Google Scholar
- C. W. Wampler, A. P. Morgan, and A. J. Sommese. 1992. Complete solution of the nine-point path synthesis problem for four-bar linkages. ASME J. Mech. Des. 114, 1 (1992), 153--159. Google ScholarCross Ref
- E. W. Weisstein. 2014. Barth Sextic. Retrieved from mathworld.wolfram.com/BarthSextic.html.Google Scholar
Index Terms
- Algorithm 976: Bertini_real: Numerical Decomposition of Real Algebraic Curves and Surfaces
Recommendations
Symbolic-numeric completion of differential systems by homotopy continuation
ISSAC '05: Proceedings of the 2005 international symposium on Symbolic and algebraic computationTwo ideas are combined to construct a hybrid symbolic-numeric differential-elimination method for identifying and including missing constraints arising in differential systems. First we exploit the fact that a system once differentiated becomes linear ...
What is numerical algebraic geometry?
The foundation of algebraic geometry is the solving of systems of polynomial equations. When the equations to be considered are defined over a subfield of the complex numbers, numerical methods can be used to perform algebraic geometric computations ...
A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
Let F1, F2,..., Ft be multivariate polynomials (with complex coefficients) in the variables z1, z2,..., Zn. The common zero locus of these polynomials, V(F1, F2,..., Ft) = {p ∈ Cn|Fi(p) = 0 for 1 ≤i ≤t}, determines an algebraic set. This algebraic set ...
Comments