Affiliation:
1. Computer Science Department, California Institute of Technology, Pasadena, California
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,General Computer Science
Reference22 articles.
1. Superquadrics and Angle-Preserving Transformations
2. Global and local deformations of solid primitives
3. A Generalization of Algebraic Surface Drawing
4. Modeling the mighty maple
5. Jules Blomenthal Polygonization of Implicit Surfaces Course Notes on "The Modeling of Natural Phenomena" Siggraph 1987. Jules Blomenthal Polygonization of Implicit Surfaces Course Notes on "The Modeling of Natural Phenomena" Siggraph 1987.
Cited by
82 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献