SLEVEs for planar spline curves

Computer Aided Geometric Design

Volumn 21, Issue 6, 2004, Pages 615-635

  Peters, Jörg ^a   Wu, Xiaobin ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Approximate implicitization; Boundedness certificate; One sided bounds; Sleve; Spline curve

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; FUNCTIONS; OPTIMIZATION; POLYNOMIALS;

APPROXIMATE IMPLICITIZATION; BOUNDEDNESS CERTIFICATE; ONE-SIDED BOUNDS; SLEVES; SPLINE CURVES;

COMPUTER AIDED DESIGN;

EID: 2942667942     PISSN: 01678396     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cagd.2004.04.004     Document Type: Article

References (32)

1. Basch, J., 1999. Kinetic data structures. PhD thesis, Stanford University.
2. Buck R.C. Applications of duality in approximation theory. Approximation of Functions. Proc. Sympos. General Motors Res. Lab., 1964: 1965;27-42 Elsevier, Amsterdam.
3. Cohen J., Varshney A., Manocha D., Turk G., Weber H., Agarwal P., Brooks F.P. Jr., Wright W. Simplification envelopes. Rushmeier H. SIGGRAPH 96 Conf. Proc. New Orleans, LA, 4-9 August 1996: 1996;119-128 Addison-Wesley.
4. Crosnier A., Rossignac J.R. Technical section - tribox bounds for three-dimensional objects. Computers and Graphics. 23:(3):1999;429-437.
5. Farin G. Curves and Surfaces for Computer-Aided Geometric Design: A Practical Guide. fourth ed: 1997;Academic Press, New York.
6. Filip D., Magedson R., Markot R. Surface algorithms using bounds on derivatives. Computer Aided Geometric Design. 3:(4):1986;295-311.
7. Gottschalk S., Lin M.C., Manocha D. OBBTree: A hierarchical structure for rapid interference detection. Computer Graphics (Annual Conference Series). 30:1996;171-180.
8. Hu C., Maekawa T., Sherbrooke E.C., Patrikalakis N.M. Robust interval algorithm for curve intersections. Computer-Aided Design. 28:(6-7):1996;495-506.
9. Hu C., Patrikalakis N.M., Ye X. Robust interval solid modelling part I: representations. Computer-Aided Design. 28:(10):1996;807-817.
10. Hu C., Patrikalakis N.M., Ye X. Robust interval solid modelling part II: boundary evaluation. Computer-Aided Design. 28:(10):1996;819-830.
11. Karavelas, M., Kaklis, P., Kostas, K., 2002. Alternative bounds on the distance between 2d parametric Bézier curves and their control polygon. Tech. rep., presented at the Dagstuhl Seminar on Geometric Modelling.
12. Kay T.L., Kajiya J.T. Ray tracing complex scenes. Evans D.C., Athay R.J. Computer Graphics (SIGGRAPH'86 Proceedings), vol. 20. 1986;269-278.
13. Klosowski, J.T., 1998. Efficient collision detection for interactive 3d graphics and virtual environments. PhD thesis, State University of New York at Stony Brook.
14. Klosowski J.T., Mitchell J.S.B., Sowizral H., Zikan K. Efficient collision detection using bounding volume hierarchies of k-DOPs. IEEE Trans. Visualization and Computer Graphics. 4:(1):1998;21-36.
15. Kobbelt L. Tight bounding volumes for subdivision surfaces. Werner B. Proc. Conf. on Computer Graphics and Applications (Pacific-Graphics'98). 1998;17-26 IEEE, Los Alamitos.
16. Kobbelt L., Daubert K., Seidel H.-P. Ray tracing of subdivision surfaces. Rendering Techniques'98 (Proc. Eurographics Workshop). 1998;69-80 Springer-Verlag, New York.
17. Lutterkort, D., 2000. Envelopes for nonlinear geometry. PhD thesis, Purdue University.
18. Lutterkort D., Peters J. Smooth paths in a polygonal channel. Proc. 15th Annual Symp. on Computational Geometry. 1999;316-321.
19. Lutterkort D., Peters J. Optimized refinable enclosures of multivariate polynomial pieces. Computer Aided Geometric Design. 18:(9):2001;851-863.
20. Lutterkort D., Peters J. Tight linear bounds on the distance between a spline and its B-spline control polygon. Numerische Mathematik. 89:2001;735-748.
21. Nairn D., Peters J., Lutterkort D. Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon. Computer Aided Geometric Design. 16:(7):1999;613-633.
22. Peters J., Wu X. On the optimality of piecewise linear max-norm enclosures based on slefes. Proc. 2002 St Malo Conference on Curves and Surfaces. 2003;335-344.
23. 1-approximation. 1989;Cambridge University Press, Cambridge.
24. Prautzsch H., Boehm W., Paluszny M. Bézier and B-spline Technique. 2002;Springer-Verlag, Berlin.
25. Reif U. Best bounds on the approximation of polynomials and splines by their control structure. Computer Aided Geometric Design. 17:(6):2000;579-589.
26. Sander P., Gu X., Gortler S., Hoppe H., Snyder J. Silhouette clipping. Computer Graphics (Annual Conference Series). 34:2000;327-334.
27. Sederberg T.W., Farouki R.T. Approximation by interval Bézier curves. IEEE Computer Graphics and Applications. 12:(5):1992;87-95.
28. Sederberg T.W., White S.C., Zundel A.K. Fat arcs: A bounding region with cubic convergence. Computer Aided Geometric Design. 6:1989;205-218.
29. Shen G., Patrikalakis M. Numerical and geometric properties of interval B-splines. Int. J. Shape Modeling. 4:1998;35-62.
30. Tuohy S.T., Maekawa T., Shen G., Patrikalakis N.M. Approximation of measured data with interval B-splines. Computer-Aided Design. 29:(11):1997;791-799.
31. Welzl E. Smallest enclosing disks (balls and ellipsoids). Maurer H. Proc. New Results and New Trends in Computer Science. Lecture Notes in Comput. Sci. vol. 555:1991;359-370 Springer-Verlag, Berlin.
32. Wu X., Peters J. The SubLiME package (Subdividable Linear Maximum-norm Enclosure). Downloadable from http://www.cise.ufl.edu/research/SurfLab/SubLiME/.