Contouring a bivariate quadratic polynomial over a triangle
The authors consider the problem of contouring a bivariate quadratic polynomial, defined as a triangular Bézier patch. The problem of contouring a quadratic polynomial over a triangle has been earlier considered by \textit{S. Marlow} and \textit{M. J. D. Powell} [A Fortran subroutine for plotting the part of a conic that is inside a given triangle. Report No.R8336, Atomic Energy Res. Establishment, Harwell, England (1976)] and the second author [Comput. Aided Geom. Des. 3, 83-127 (1986; Zbl 0633.65007)]. The algorithms given by these authors have some deficiencies. In this paper an algorithm for solving this problem is presented which is more efficient and accurate than that of Marlow and Powell and far more robust than that of the second author. The authors use the Bernstein- Bézier form for quadratic polynomials defined over a triangle, and also for describing conic sections. Recent results show that the Bernstein basis for polynomials is more stable for numerical computations than the monomial basis.
- A 'taut string algorithm' for straightening a piecewise linear path in two dimensions
- A survey of curve and surface methods in CAGD
- Adaptive contouring of three-dimensional surfaces
- Algorithms for polynomials in Bernstein form
- scientific article; zbMATH DE number 3613777 (Why is no real title available?)
- On the numerical condition of algebraic curves and surfaces. I: Implicit equations
- On the numerical condition of polynomials in Bernstein form
- Piecewise Quadratic Approximations on Triangles
This page was built for publication: Contouring a bivariate quadratic polynomial over a triangle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804216)
