Convergent bounds for the range of multivariate polynomials
Proceedings of the International Symposium on interval mathematics on Interval mathematics 1985
On the numerical condition of polynomials in Berstein form
Computer Aided Geometric Design
Algorithms for polynomials in Bernstein form
Computer Aided Geometric Design
Quadtree algorithms for contouring functions of two variables
The Computer Journal - Special issue on graphics and visualisation
A new method of evaluating compact geometric bounds for use in subdivision algorithms
Computer Aided Geometric Design
Interval analysis for computer graphics
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Interval arithmetic recursive subdivision for implicit functions and constructive solid geometry
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Curves and surfaces for computer aided geometric design (3rd ed.): a practical guide
Curves and surfaces for computer aided geometric design (3rd ed.): a practical guide
Distance approximations for rasterizing implicit curves
ACM Transactions on Graphics (TOG)
Surface intersection using affine arithmetic
GI '96 Proceedings of the conference on Graphics interface '96
Sampling procedural shaders using affine arithmetic
ACM Transactions on Graphics (TOG)
A Tracking Algorithm for Implicitly Defined Curves
IEEE Computer Graphics and Applications
Approximation by Interval Bezier Curves
IEEE Computer Graphics and Applications
Rasterizing Algebraic Curves and Surfaces
IEEE Computer Graphics and Applications
Interval and Affine Arithmetic for Surface Location of Power- and Bernstein-Form Polynomials
Proceedings of the 9th IMA Conference on the Mathematics of Surfaces
Interval Methods in Geometric Modeling
GMP '00 Proceedings of the Geometric Modeling and Processing 2000
Methods and Applications of Interval Analysis (SIAM Studies in Applied and Numerical Mathematics) (Siam Studies in Applied Mathematics, 2.)
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
Journal of Computational and Applied Mathematics - Special issue: The international symposium on computing and information (ISCI2004)
Bernstein-Bezoutian matrices and curve implicitization
Theoretical Computer Science
Useful computations need useful numbers
ACM Communications in Computer Algebra
Zeros of univariate interval polynomials
Journal of Computational and Applied Mathematics
Querying continuous functions in a database system
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Technical Section: GPU-based rendering of curved polygons using simplicial coverings
Computers and Graphics
Topology determination and isolation for implicit plane curves
Proceedings of the 2009 ACM symposium on Applied Computing
Proceedings of the twenty-fifth annual symposium on Computational geometry
Enhancing numerical constraint propagation using multiple inclusion representations
Annals of Mathematics and Artificial Intelligence
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I
On the degree elevation of Bernstein polynomial representation
Journal of Computational and Applied Mathematics
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Polytope-based computation of polynomial ranges
Proceedings of the 2010 ACM Symposium on Applied Computing
Linear programming for Bernstein based solvers
ADG'08 Proceedings of the 7th international conference on Automated deduction in geometry
Trustworthy numerical computation in Scala
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Polytope-based computation of polynomial ranges
Computer Aided Geometric Design
Direct solutions for computing cylinders from minimal sets of 3d points
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part I
Non-local isotopic approximation of nonsingular surfaces
Computer-Aided Design
Reachability analysis of polynomial systems using linear programming relaxations
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
On exact rasterization of real algebraic plane curves
Proceedings of the 27th Spring Conference on Computer Graphics
Algorithm for min-range multiplication of affine forms
Numerical Algorithms
Hi-index | 0.00 |
This paper compares the performance and efficiency of different function range interval methods for plotting f(x, y)=0 on a rectangular region based on a subdivision scheme, where f(x, y) is a polynomial. The solution of this problem has many applications in CAGD. The methods considered are interval arithmetic methods (using the power basis, Bernstein basis, Homer form and centred form), an affine arithmetic method, a Bernstein coefficient method, Taubin's method, Rivlin's method, Gopalsamy's method, and related methods which also take into account derivative information. Our experimental results show that the affine arithmetic method, interval arithmetic using the centred form, the Bernstein coefficient method, Taubin's method, Rivlin's method, and their related derivative methods have similar performance, and generally they are more accurate and efficient than Gopalsamy's method and interval arithmetic using the power basis, the Bernstein basis, and Horner form methods.