Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Polygonization of implicit surfaces
Computer Aided Geometric Design
Algorithm for algebraic curve intersection
Computer-Aided Design
Guaranteed ray intersections with implicit surfaces
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Curves and surfaces for computer aided geometric design
Curves and surfaces for computer aided geometric design
An implicit surface polygonizer
Graphics gems IV
Using particles to sample and control implicit surfaces
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
A new approach to the surface intersection problem
Computer Aided Geometric Design
Multiresolution tetrahedral framework for visualizing regular volume data
VIS '97 Proceedings of the 8th conference on Visualization '97
Geometric constraint solver using multivariate rational spline functions
Proceedings of the sixth ACM symposium on Solid modeling and applications
Introduction to Implicit Surfaces
Introduction to Implicit Surfaces
Efficient topology determination of implicitly defined algebraic plane curves
Computer Aided Geometric Design
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Computing the topology of real algebraic surfaces
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Contouring 1- and 2-Manifolds in Arbitrary Dimensions
SMI '05 Proceedings of the International Conference on Shape Modeling and Applications 2005
Provably good sampling and meshing of surfaces
Graphical Models - Solid modeling theory and applications
Almost tight recursion tree bounds for the Descartes method
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Curve and Surface Reconstruction: Algorithms with Mathematical Analysis (Cambridge Monographs on Applied and Computational Mathematics)
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
Computation of the solutions of nonlinear polynomial systems
Computer Aided Geometric Design
Computation of the topology of real algebraic space curves
Journal of Symbolic Computation
Determining the topology of real algebraic surfaces
IMA'05 Proceedings of the 11th IMA international conference on Mathematics of Surfaces
ACM Transactions on Graphics (TOG)
Using Smith normal forms and µ-bases to compute all the singularities of rational planar curves
Computer Aided Geometric Design
Cell decomposition of almost smooth real algebraic surfaces
Numerical Algorithms
Hi-index | 0.00 |
In this paper, we consider the problem of analysing the shape of an object defined by polynomial equations in a domain. We describe regularity criteria which allow us to determine the topology of the implicit object in a box from information on the boundary of this box. Such criteria are given for planar and space algebraic curves and for algebraic surfaces. These tests are used in subdivision methods in order to produce a polygonal approximation of the algebraic curves or surfaces, even if it contains singular points. We exploit the representation of polynomials in Bernstein basis to check these criteria and to compute the intersection of edges or facets of the box with these curves or surfaces. Our treatment of singularities exploits results from singularity theory such as an explicit Whitney stratification or the local conic structure around singularities. A few examples illustrate the behavior of the algorithms.