Numerical roadmap of smooth bounded real algebraic surface

Abstract For a smooth bounded real algebraic surface in R n , a roadmap of it is a one-dimensional semi-algebraic subset of the surface whose intersection with each connected component of the surface is nonempty and semi-algebraically connected. In this paper, we introduce the notion of a numerical roadmap of a surface, which is a set of disjoint polygonal chains such that there is a bijective map between the chains and the connected components of a given roadmap of the surface. Moreover, the chains are ϵ-close to the connected components. We present an algorithm to compute such a numerical roadmap through constructing a topological graph. The topological graph also enables us to compute an approximate graph and a more intrinsic connectivity graph to represent the roadmap and its connectivity property, which is important for applications such as determining if two points on the surface belong to the same connected component and if so, finding a connected path between them.

[1]  Daniela Giorgi,et al.  Reeb graphs for shape analysis and applications , 2008, Theor. Comput. Sci..

[2]  S. Basu,et al.  Algorithms in real algebraic geometry , 2003 .

[3]  Yong Feng,et al.  Visualizing Planar and Space Implicit Real Algebraic Curves with Singularities , 2019, Journal of Systems Science and Complexity.

[4]  Anton Leykin,et al.  Robust Certified Numerical Homotopy Tracking , 2011, Foundations of Computational Mathematics.

[5]  S. Basu,et al.  COMPUTING ROADMAPS OF SEMI-ALGEBRAIC SETS ON A VARIETY , 1999 .

[6]  Joos Heintz,et al.  Single Exponential Path Finding in Semialgebraic Sets. Part 1: The Case of a Regular Bounded Hypersurface , 1990, AAECC.

[7]  Guoliang Xu,et al.  Piecewise Rational Approximations of Real Algebraic Curves , 1997 .

[8]  Éric Schost,et al.  A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets , 2013, J. ACM.

[9]  Gert Vegter,et al.  Isotopic meshing of implicit surfaces , 2006, The Visual Computer.

[10]  Kai Jin,et al.  Isotopic epsilon-meshing of real algebraic space curves , 2014, SNC.

[11]  Bernard Mourrain,et al.  Isotopic triangulation of a real algebraic surface , 2009, J. Symb. Comput..

[12]  Tamal K. Dey,et al.  Sampling and meshing a surface with guaranteed topology and geometry , 2004, SCG '04.

[13]  Jonathan D. Hauenstein,et al.  Cell decomposition of almost smooth real algebraic surfaces , 2013, Numerical Algorithms.

[14]  Alexandre Goldsztejn,et al.  Certified Parallelotope Continuation for One-Manifolds , 2013, SIAM J. Numer. Anal..

[15]  Marie-Françoise Roy,et al.  Divide and Conquer Roadmap for Algebraic Sets , 2014, Discret. Comput. Geom..

[16]  Bernard Mourrain,et al.  A symbolic-numeric silhouette algorithm , 2000, Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113).

[17]  Fabrice Rouillier,et al.  Solving Zero-Dimensional Systems Through the Rational Univariate Representation , 1999, Applicable Algebra in Engineering, Communication and Computing.

[18]  Anton Leykin,et al.  Newton's method with deflation for isolated singularities of polynomial systems , 2006, Theor. Comput. Sci..

[19]  Herbert Edelsbrunner,et al.  Reeb spaces of piecewise linear mappings , 2008, SCG '08.

[20]  Éric Schost,et al.  A Baby Step–Giant Step Roadmap Algorithm for General Algebraic Sets , 2012, Found. Comput. Math..

[21]  Lenore Blum,et al.  Complexity and Real Computation , 1997, Springer New York.

[22]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[23]  Yong Feng,et al.  Computing real witness points of positive dimensional polynomial systems , 2017, Theor. Comput. Sci..

[24]  Bernard Mourrain,et al.  On the isotopic meshing of an algebraic implicit surface , 2012, J. Symb. Comput..

[25]  Éric Schost,et al.  A Baby Steps/Giant Steps Probabilistic Algorithm for Computing Roadmaps in Smooth Bounded Real Hypersurface , 2011, Discret. Comput. Geom..

[26]  Bo Dong,et al.  Robust continuation methods for tracing solution curves of parameterized systems , 2013, Numerical Algorithms.

[27]  Tosiyasu L. Kunii,et al.  Constructing a Reeb graph automatically from cross sections , 1991, IEEE Computer Graphics and Applications.

[28]  Bernard Mourrain,et al.  On the computation of the topology of a non-reduced implicit space curve , 2008, ISSAC '08.

[29]  Silvia Biasotti,et al.  Topology-driven shape chartification , 2018, Comput. Aided Geom. Des..

[30]  Wenrui Hao,et al.  Algorithm 976 , 2017, ACM Trans. Math. Softw..

[31]  Tsung-Lin Lee,et al.  HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method , 2008, Computing.

[32]  Jean-Daniel Boissonnat,et al.  Isotopic Implicit Surface Meshing , 2008, Discret. Comput. Geom..

[33]  Hamidreza Chitsaz,et al.  NUROA: A numerical roadmap algorithm , 2014, 53rd IEEE Conference on Decision and Control.

[34]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[35]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .