A new method of evaluating compact geometric bounds for use in subdivision algorithms

DOI10.1016/0167-8396(91)90009-ZzbMath0742.65011OpenAlexW2016032951MaRDI QIDQ1183527

Dilip Khandekar, S. P. Mudur, Sankarappan Gopalsamy

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0167-8396(91)90009-z

zbMATH Keywords

surfacesplinescurvecomputer graphicsmultivariate polynomialssubdivision algorithmscompact geometric boundsconstruction of boxes

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (2)

Revisiting the problem of zeros of univariate scalar Béziers ⋮ Comparison of interval methods for plotting algebraic curves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A marching method for parametric surface/surface intersection
• A survey of curve and surface methods in CAGD
• Surface algorithms using bounds on derivatives
• Fat arcs: A bounding region with cubic convergence
• Bounds on a polynomial
• A practical guide to splines
• Implementation of a divide-and-conquer method for intersection of parametric surfaces
• Computational techniques for processing parametric surfaces
• On local implicit approximation and its applications
• Bernstein form of a polynomial
• Bounds on a polynomial

This page was built for publication: A new method of evaluating compact geometric bounds for use in subdivision algorithms