Comparison of interval methods for plotting algebraic curves

DOI10.1016/S0167-8396(02)00146-2zbMath0998.68184OpenAlexW2162082792MaRDI QIDQ1608860

Adrian Bowyer, Irina Voiculescu, Huahao Shou, Guo-Jin Wang, Ralph R. Martin

Publication date: 13 August 2002

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8396(02)00146-2

zbMATH Keywords

interval analysissubdivisionalgebraic curvesrange analysis

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Algorithm for min-range multiplication of affine forms, On the topology and isotopic meshing of plane algebraic curves, Bernstein-Bezoutian matrices and curve implicitization, A new algorithm for Chebyshev minimum-error multiplication of reduced affine forms, Polytope-based computation of polynomial ranges, Isotopic meshing of a real algebraic space curve, Zeros of univariate interval polynomials, Adaptive isotopic approximation of nonsingular curves: The parameterizability and nonlocal isotopy approach, On the degree elevation of Bernstein polynomial representation, Modified affine arithmetic in tensor form for trivariate polynomial evaluation and algebraic surface plotting, Robust plotting of polar algebraic curves, space algebraic curves, and offsets of planar algebraic curves, Numerical integration over implicitly defined domains with topological guarantee, Exact, efficient, and complete arrangement computation for cubic curves, The influence of interval arithmetic on the shape of uncertainly defined domains modelled by closed curves, An efficient method for tracing planar implicit curves, Non-intrusive hybrid interval method for uncertain nonlinear systems using derivative information, Enhancing numerical constraint propagation using multiple inclusion representations

Cites Work

• Robust arithmetic for multivariate Bernstein-form polynomials
• Robust interval solid modelling. I: Representations.
• Robust interval solid modelling. II: Boundary evaluation.
• On the numerical condition of polynomials in Bernstein form
• Algorithms for polynomials in Bernstein form
• A new method of evaluating compact geometric bounds for use in subdivision algorithms
• Affine arithmetic in matrix form for polynomial evaluation and algebraic curve drawing
• Distance approximations for rasterizing implicit curves
• Bernstein form of a polynomial
• Bounds on a polynomial
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item