home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.graphics
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!usc!cs.utexas.edu!torn!watserv1!watmath!undergrad.math.waterloo.edu!cayley.waterloo.edu!icfaragh
- From: icfaragh@cayley.waterloo.edu (Chad Faragher)
- Subject: ALGORITHM NEEDED: Ray-Spline Intersection
- Message-ID: <Bs1x11.8s7@undergrad.math.waterloo.edu>
- Sender: news@undergrad.math.waterloo.edu
- Organization: University of Waterloo
- Date: Mon, 27 Jul 1992 14:17:25 GMT
- Lines: 12
-
- Preliminary: What's a good data-structure for storing spline information (for
- ray-tracing.
-
- Now... How do you raytrace a b-spline? Is there an algorithm for intersecting
- a ray and a spline surface? Do I have to implement a nifty Newton root?
- Does the solution involve recursion (Octrees & area subdivision)?
-
- Break it into polygons you say? Heard it... Not gonna do it. Gotta be
- a better way.
-
- Chad Faragher -- University of Waterloo
-
-