ACM Home Page
Please provide us with feedback. Feedback
Guaranteed ray intersections with implicit surfaces
Full text PdfPdf (2.91 MB)
Source International Conference on Computer Graphics and Interactive Techniques archive
Proceedings of the 16th annual conference on Computer graphics and interactive techniques table of contents
Pages: 297 - 306  
Year of Publication: 1989
ISBN:0-89791-312-4
Also published in ...
Authors
D. Kalra  Computer Science Department, California Institute of Technology, Pasadena, California
A. H. Barr  Computer Science Department, California Institute of Technology, Pasadena, California
Sponsor
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 63,   Citation Count: 32
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/74333.74364
What is a DOI?

ABSTRACT

In this paper, we present a robust and mathematically sound ray-intersection algorithm for implicit surfaces. The algorithm is guaranteed to numerically find the nearest intersection of the surface with a ray, and is guaranteed not to miss fine features of the surface. It does not require fine tuning or human choice of interactive parameters. Instead, it requires two upper bounds: "L" that limits the net rate of change of the implicit surface function f(x,y,z) and "G" that limits the rate of change of the gradient. We refer to an implicit surface with these rate limits as an "LG-implicit surface."Existing schemes to intersect a ray with an implicit surface have typically been guaranteed to work only for a limited set of implicit functions, such as quadric surfaces or polynomials, or else have been ad-hoc and have not been guaranteed to work. Our technique significantly extends the ability to intersect rays with implicit surfaces in a guaranteed fashion.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
BARR 81
Alan H. Barr, Superquadrics and Angle-Preserving Transformations, IEEE Computer Graphics and Applications, Jan '81.
BARR 84
BLINN 82
BLOOMENTHAL 85
 
BLOOMENTHAL 87
Jules Blomenthal, Polygonization of Implicit Surfaces, Course Notes on "The Modeling of Natural Phenomena", Siggraph 1987.
COLLINS AND AKRITAS 76
 
GEAR 71
 
GLASSNER 84
Space Subdivision for Fast Ray Tracingr Andrew S. Glassnet, IEEE Computer Graphics and Applications, October '84.
HANRAHAN 83
 
KALRA and BARR 89
Devendra Kalra and Alan H. Barr, Guaranteed lntersection.~ with lmplicit surfaces, Galtech Computer Science Tech Report.
 
LIN AND SEGEL 74
Mathematics Applied To Deterministic Problems In The Natural Sciences, C. C. Lin and L. A. Segel, Macmillan Publishing Co., Inc., New York.
LORENSEN AND CLINE 87
MIDDLEDITCH et al 85
PLATT and BARR
 
SMP
Steven Wolfram et ~1,, SMP: A symbol manipulation Package, California Institute of Technology, 1981.
TERZOPOULOS et al
 
USPENSKY 48
Uspensky, J. V., Theory of Equations, McGraw-Hill, 1948.
 
VON HERZEN 84
Brian P. Van Herzen, Sampling Deformed, Intersecting Surfaces with Quadtrees, Master's Thesis, Caltech, 1984.
VON HERZEN 88
 
VON HERZEN 89
Brian Van Herzen, Alan H, Barr, Harold R. Zatz, Collision Determination for Parametric Surfaces, Caltech CS Technica} Report.
 
WYVILL 86
 
WYVILL 87(1)
Solid Texturing of Soft Objects, Geo}J Wyvill, Brian Wyvill, Craig Pheeters, IEEE Computer Graphics and Applications, December '87.
 
WYVILL 87(2)
Animating Soft Objects, Geoff Wyvill, Craig Pheeters, Brian Wyvill, The Visual Computer, (1986)2.

CITED BY  32
 
 
 
 
 
 
 
 
 
 
 
 
 


Peer to Peer - Readers of this Article have also read: