Intersection Algorithms Based On Geometric Intervals
This thesis introduces new algorithms for solving curve/curve and ray/surface intersections. These algorithms introduce the concept of a geometric interval to extend the technique of Bézier clipping. A geometric interval is used to tightly bound a curve or surface or to contain a point on a curve or...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
BYU ScholarsArchive
2007
|
| Subjects: | |
| Online Access: | https://scholarsarchive.byu.edu/etd/1207 https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=2206&context=etd |