Threading splines through 3D channels

CAD Computer Aided Design

Volumn 37, Issue 2, 2005, Pages 139-148

  Myles, Ashish ^a   Peters, Jörg ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

Computational geometry channels; Constrained curve fitting; Linear programming; SLEFE

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; THREAD CUTTING;

COMPUTATIONAL GEOMETRY CHANNELS; CONSTRAINED CURVE FITTING; POLYGONAL CHANNEL; SLEFE;

SPLINES;

EID: 4544300733     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cad.2004.04.004     Document Type: Article

References (19)

1. Crosnier A., Rossignac J.R. Technical Section - tribox bounds for three-dimensional objects. Comput Graph. 23:(3):1999;429-437.
2. Czyzyk J, Mehrotra S, Wagner M, Wright S. http://www-fp.mcs.anl.gov/otc/ Tools/PCx.
3. Dobkin D., Ganser E.R., Koutsofios E., North S.C. A path router for graph drawing. In: Proceedings of the 14th Annual Symposium on Computational Geometry, 415-416. 1998;ACM Press, New York. June 1-10, Minneapolis, MN.
4. Farouki R.T., Sakkalis T. Pythagorean hodographs. IBM J Res Dev. 34:(5):1990;736-752.
5. Filip D., Magedson R., Markot R. Surface algorithms using bounds on derivatives. Comput Aid Geom Des. 3:(4):1986;295-311.
6. Gottschalk S., Lin M., Manocha D. OBBTree: a hierarchical structure for rapid interference detection. In: Proceedings of the ACM Conference on Computer Graphics. August 4-9:1996;ACM Press, New York. pp. 171-180.
7. Rokne J., Ratshek H. Geometric computations with interval and new robust methods: with applications in computer graphics, gis and computational geometry. 2003;Horwood Publishing, Chichester.
8. Kay T.L., Kajiya J.T. Ray tracing complex scenes. Evans D.C., Athay R.J. Computer Graphics (SIGGRAPH'86 Proceedings), August. vol. 20:1986;269-278.
9. Klosowski J.T., Mitchell J.S.B., Sowizral H., Zikan K. Efficient collision detection using bounding volume hierarchies of k-DOPs. IEEE Trans Visual Comput Graph. 4:(1):1998;21-36.
10. Kobbelt L., Daubert K., Seidel H.-P. Ray tracing of subdivision surfaces. In Rendering Techniques'98 (Proceedings of the Eurographics Workshop). June:1998;Springer, New York. p. 69-80.
11. Lutterkort D., Peters J. Smooth paths in a polygonal channel. In: Proceedings of the 15th Annual Symposium on Computational Geometry. 1999;. p. 316-321.
12. Lutterkort D. Envelopes for nonlinear geometry. PhD thesis, Purdue University; May 2000.
13. Peters J. Efficient one-sided linearization of spline geometry. Martin R.R. Mathematics of surfaces X. IMA. 2003;297-319.
14. Peters J., Wu X. On the optimality of piecewise linear max-norm enclosures based on slefes. In: Proceedings of the St Malo Conference on Curves and Surfaces. 2002;. p. 335-344.
15. Peters J., Wu X. Sleves for planar spline curves. Comput Aid Geom Des. 2004;. (in press).
16. Sederberg T.W., White S.C., Zundel A.K. Fat arcs: a bounding region with cubic convergence. Comput Aid Geom Des. 6:1989;205-218.
17. Tamassia R. Graph drawing. Sack J.R., Urrutia J. Handbook of computational geometry. 2000;Elsevier, Amsterdam.
18. Welzl E. Smallest enclosing disks (balls and ellipsoids). Maurer H. Proceedings of New Results and New Trends in Computer Science. vol. 555:1991;359-370 Springer, Berlin.
19. Wu X, Peters J. The SubLiME (subdividable linear maximum-norm enclosure) package. http://www.cise.ufl.edu/research/SurfLab/SubLiME.