Fat arcs: a bounding region with cubic convergence
Computer Aided Geometric Design
Fundamentals of computer aided geometric design
Fundamentals of computer aided geometric design
Regular algebraic curve segments (I)-definitions and characteristics
Computer Aided Geometric Design
Strip trees: a hierarchical representation for curves
Communications of the ACM
Principles of CAD/CAM/CAE Systems
Principles of CAD/CAM/CAE Systems
Mathematical Methods for Curves and Surfaces
Shape Interrogation for Computer Aided Design and Manufacturing
Shape Interrogation for Computer Aided Design and Manufacturing
Efficient topology determination of implicitly defined algebraic plane curves
Computer Aided Geometric Design
An arc spline approximation to a clothoid
Journal of Computational and Applied Mathematics
Computing roots of polynomials by quadratic clipping
Computer Aided Geometric Design
Subdivision methods for solving polynomial equations
Journal of Symbolic Computation
Approximating curves and their offsets using biarcs and Pythagorean hodograph quintics
Computer-Aided Design
Spiral fat arcs - Bounding regions with cubic convergence
Graphical Models
| Hi-index | 0.00 |
We present an algorithm generating a collection of fat arcs which bound the zero set of a given bivariate polynomial in Bernstein–Bézier representation. We demonstrate the performance of the algorithm (in particular the convergence rate) and we apply the results to the computation of intersection curves between implicitly defined algebraic surfaces and rational parametric surfaces.