Representing rational curve segments and surface patches using semi-algebraic sets

Abstract We provide a framework for representing segments of rational planar curves or patches of rational tensor product surfaces with no singularities using semi-algebraic sets. Given a rational planar curve segment or a rational tensor product surface patch with no singularities, we find the implicit equation of the corresponding unbounded curve or surface and then construct an algebraic box defined by some additional equations and inequalities associated to the implicit equation. This algebraic box is proved to include only the given curve segment or surface patch without any extraneous parts of the unbounded curve or surface. We also explain why it is difficult to construct such an algebraic box if the curve segment or surface patch includes some singular points such as self-intersections. In this case, we show how to isolate a neighborhood of these special points from the corresponding curve segment or surface patch and to represent these special points with small curve segments or surface patches. This framework allows us to dispense with expensive approximation methods such as voxels for representing surface patches.

[1]  Bernard Mourrain,et al.  Residue and Implicitization Problem for Rational Surfaces , 2003, Applicable Algebra in Engineering, Communication and Computing.

[2]  Xiaohong Jia,et al.  Homeomorphic approximation of the intersection curve of two rational surfaces , 2012, Comput. Aided Geom. Des..

[3]  André Galligo,et al.  A sampling algorithm computing self-intersections of parametric surfaces , 2006, Algebraic Geometry and Geometric Modeling.

[4]  Eng-Wee Chionh,et al.  Corner edge cutting and Dixon A-resultant quotients , 2004, J. Symb. Comput..

[5]  Gershon Elber,et al.  Surface self-intersection computation via algebraic decomposition , 2009, Comput. Aided Des..

[6]  Xuan-Yi Zhao,et al.  Geometric conditions of non-self-intersecting NURBS surfaces , 2017, Appl. Math. Comput..

[7]  Xiao-Shan Gao,et al.  Topology determination and isolation for implicit plane curves , 2009, SAC '09.

[8]  Samuli Laine.  A Topological Approach to Voxelization , 2013, Comput. Graph. Forum.

[9]  Ron Goldman,et al.  µ-Bases and singularities of rational planar curves , 2009, Comput. Aided Geom. Des..

[10]  B. Laurent,et al.  Implicit matrix representations of rational Bézier curves and surfaces , 2014 .

[11]  Sonia Pérez-Díaz.  Computation of the singularities of parametric plane curves , 2007, J. Symb. Comput..

[12]  Xuan-Yi Zhao,et al.  Injectivity conditions of rational Bézier surfaces , 2015, Comput. Graph..

[13]  J. Rafael Sendra,et al.  Computing the singularities of rational surfaces , 2011, Math. Comput..

[14]  Neil F. Stewart,et al.  Selfintersection of composite curves and surfaces , 1998, Computer Aided Geometric Design.

[15]  Ron Goldman,et al.  Implicitizing Rational Tensor Product Surfaces Using the Resultant of Three Moving Planes , 2017, ACM Trans. Graph..

[16]  Xiao-Shan Gao,et al.  Proper Reparametrization of Rational Ruled Surface , 2007, 2007 10th IEEE International Conference on Computer-Aided Design and Computer Graphics.

[17]  Ron Goldman,et al.  Combining complementary methods for implicitizing rational tensor product surfaces , 2018, Comput. Aided Des..

[18]  Eng-Wee Chionh.  Rectangular Corner Cutting and Dixon A-resultants , 2001, J. Symb. Comput..

[19]  Kai Jin,et al.  A generic position based method for real root isolation of zero-dimensional polynomial systems , 2013, J. Symb. Comput..

[20]  Dinesh Manocha,et al.  Algorithm for implicitizing rational parametric surfaces , 1992, Comput. Aided Geom. Des..

[21]  Gershon Elber,et al.  Topologically guaranteed univariate solutions of underconstrained polynomial systems via no-loop and single-component tests , 2011, Comput. Aided Des..

[22]  Michael Kerber,et al.  Fast and exact geometric analysis of real algebraic plane curves , 2007, ISSAC '07.

[23]  Martin D. Buhmann,et al.  Radial Basis Functions: Theory and Implementations: Preface , 2003 .

[24]  B. F. Caviness,et al.  Quantifier Elimination and Cylindrical Algebraic Decomposition , 2004, Texts and Monographs in Symbolic Computation.

[25]  Falai Chen,et al.  Implicitization using moving curves and surfaces , 1995, SIGGRAPH.

[26]  Falai Chen,et al.  The µ-basis of a planar rational curve: properties and computation , 2002 .

[27]  Juan Carlos Díaz Martín,et al.  Finding the number of roots of a polynomial in a plane region using the winding number , 2014, Comput. Math. Appl..

[28]  Li-Yong Shen,et al.  Implicitization using univariate resultants , 2010, J. Syst. Sci. Complex..

[29]  Arie E. Kaufman,et al.  Fundamentals of Surface Voxelization , 1995, CVGIP Graph. Model. Image Process..

[30]  Dinesh Manocha,et al.  An efficient surface intersection algorithm based on lower-dimensional formulation , 1997, TOGS.

[31]  Bernard Mourrain,et al.  Subdivision methods for solving polynomial equations , 2009, J. Symb. Comput..

[32]  Richard K. Beatson,et al.  Reconstruction and representation of 3D objects with radial basis functions , 2001, SIGGRAPH.

[33]  Kurt Mehlhorn,et al.  Computing real roots of real polynomials , 2013, J. Symb. Comput..

[34]  Xianming Chen,et al.  Theoretically Based Robust Algorithms for Tracking Intersection Curves of Two Deforming Parametric Surfaces , 2006, GMP.

[35]  Falai Chen,et al.  The μ -basis and implicitization of a rational parametric surface , 2005 .

[36]  B. Buchberger,et al.  Grobner Bases : An Algorithmic Method in Polynomial Ideal Theory , 1985 .