Computations with Tight Bounding Volumes for General Parametric Surfaces
نویسنده
چکیده
Methods for computing tight bounding volumes for general parametric surfaces, for testing if two bounding volumes intersect and for computing inclusions for the intersection of two bounding volumes are discussed. These methods together with interval arithmetic are the basis for a robust algorithm for computing inclusions for all parts of the intersection curve of two general parametric surfaces.
منابع مشابه
Intersecting general parametric surfaces using bounding volumes
This paper describes a robust algorithm for computing all parts of the intersection curve of two general parametric surfaces. The algorithm follows a divide-and-conquer approach. Surfaces (and parts of them) are enclosed by tight parallel epipeds and axis aligned bounding boxes. If two bounding volumes intersect, one surface is split into two patches. This step is repeated recur-sively for both...
متن کاملReliable Ray Tracing by Linear Interval Estimations
Recently Bühler has introduced a new type of bounding volume for parametric surfaces. These bounding volumes, which Bühler calls Linear Interval Estimations (LIEs), are parametrized with the same parametrization as the surfaces they bound. We report on the application of LIEs to the ray tracing of Bezier surfaces. The general nonlinear ray–surface intersection problem is replaced with a linear ...
متن کاملRay Tracing of Subdivision Surfaces
We present the necessary theory for the integration of subdivision surfaces into general purpose rendering systems. The most important functionality that has to be provided via an abstract geometry interface are the computation of surface points and normals as well as the ray intersection test. We demonstrate how to derive the corresponding formulas and how to construct tight bounding volumes f...
متن کاملCalculation of Tight Bounding Volumes for Cyclic CSG- Graphs*
Cyclic CSG graphs are a memory safe representation of objects with a very complex, recursive structure. This class of objects are defined by CSG-PL-Systems, an adaption of the well known Parametric Lindenmayer Systems (PL-Systems) to the CSG concept. They are a powerful tool to model natural phenomena like plants, clouds or fractal terrain but also linear fractals or any objects with a repetiti...
متن کاملSurface-to-surface intersection based on triangular parameter domain subdivision 100
An improved algorithm for the computation of the intersection curve of two general parametric surfaces is presented. The introduced subdivision algorithm follows a divide-and-conquer-approach. For each pair of patches, it rst checks if the corresponding bounding volumes intersect. If they intersect, then it tries to nd dispensable parts of one patch (and the corresponding parts in the parameter...
متن کامل