Visualisation of Implicit Algebraic Curves

We describe a new algorithm for the visualisation of implicit algebraic curves, which isolates the singular points, compute the topological degree around these points in order to check that the topology of the curve can be deduced from the points on the boundary of these singular regions. The other regions are divided into x or y regular regions, in which the branches of the curve are also determined from information on the boundary. Combined with enveloping techniques of the polynomial represented in the Bernstein basis, it is shown on examples that this algorithm is able to render curves defined by high degree polynomials with large coefficients, to identify regions of interest and to zoom safely on these regions.

[1]  Dietmar Saupe,et al.  Interactive Visualization of Implicit Surfaces with Singularities , 1997, Comput. Graph. Forum.

[2]  Jon G. Rokne,et al.  Scci-hybrid Methods for 2d Curve Tracing , 2005, Int. J. Image Graph..

[3]  Gershon Elber,et al.  Geometric constraint solver using multivariate rational spline functions , 2001, SMA '01.

[4]  Thomas A. Grandine,et al.  A new approach to the surface intersection problem , 1997, Comput. Aided Geom. Des..

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

[6]  Gerald Farin,et al.  Curves and surfaces for computer aided geometric design , 1990 .

[7]  Xiao-Shan Gao,et al.  Determining the Topology of Real Algebraic Surfaces , 2005, IMA Conference on the Mathematics of Surfaces.

[8]  Gershon Elber,et al.  Contouring 1- and 2-manifolds in arbitrary dimensions , 2005, International Conference on Shape Modeling and Applications 2005 (SMI' 05).

[9]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[10]  Kenji Aoki,et al.  On the number of branches of a plane curve germ , 1986 .

[11]  Laureano González-Vega,et al.  Efficient topology determination of implicitly defined algebraic plane curves , 2002, Comput. Aided Geom. Des..

[12]  Fabrice Rouillier,et al.  Bernstein's basis and real root isolation , 2004 .

[13]  Chee-Keng Yap,et al.  Almost tight recursion tree bounds for the Descartes method , 2006, ISSAC '06.

[14]  Nicholas M. Patrikalakis,et al.  Computation of the solutions of nonlinear polynomial systems , 1993, Comput. Aided Geom. Des..

[15]  B. Mourrain,et al.  Meshing implicit algebraic surfaces : the smooth case , 2004 .

[16]  Bernard Mourrain,et al.  Real Algebraic Numbers: Complexity Analysis and Experimentation , 2008, Reliable Implementation of Real Number Algorithms.

[17]  D. S. Arnon,et al.  Algorithms in real algebraic geometry , 1988 .

[18]  Michael N. Vrahatis,et al.  On the Complexity of Isolating Real Roots and Computing with Certainty the Topological Degree , 2002, J. Complex..

[19]  T. Sederberg.  Algorithm for algebraic curve intersection , 1989 .

[20]  I. Emiris,et al.  Real Algebraic Numbers: Complexity Analysis and Experimentations , 2008 .

[21]  Zbigniew Szafraniec,et al.  On the number of branches of an 1-dimensional semianalytic set , 1988 .

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

[23]  Frank Stenger,et al.  Computing the topological degree of a mapping inRn , 1975 .

[24]  B. Mourrain,et al.  Isotopic meshing of a real algebraic surface , 2006 .

[25]  Dinesh Manocha,et al.  Efficient and exact manipulation of algebraic points and curves , 2000, Comput. Aided Des..

[26]  Alicia Dickenstein,et al.  Extremal Real Algebraic Geometry and A-Discriminants , 2006 .

[27]  Rida T. Farouki,et al.  Guaranteed consistency of surface intersections and trimmed surfaces using a coupled topology resolution and domain decomposition scheme , 2007, Adv. Comput. Math..