- Full text PDF available (0)
- This year (0)
- Last 5 years (0)
- Last 10 years (0)
Journals and Conferences
Most algorithms for Boolean shape operations are complicated, slow, and of limited applicability. This one, based on a triangulation of potentially intersecting faces, is relatively fast and simple.
Representations of cubic and bicubic splines are given, combining the advantages of B-splines with the handiness of Bézier technique. The Bézier points of spline curves and surfaces are found by… (More)
An intersection detection method for solid modeling which is invariant under projective transformations is presented. We redefine the fundamental geometric figures necessary to describe solid models… (More)
-A compact solid modelling system FREEDOM-II is discussed using simple algorithms for Boolean shape operations and hidden line-surface elimination.
In the first half of the paper, various types of processing pertaining to a polygon, using the 4×4 determinant theories are explained along with a new containment test algorithm of a point in a… (More)
Triangulation is an efficient way to simplify and unify interference problems, such as hidden line and surface elimination and Boolean shape operations in solid modeling. Almost all of the processing… (More)
The author argues that as long as euclidean processing provides the basis for CAD, there will always be a limit to the level of reliability achievable in a system. In other words, a CAD system… (More)
Simple and efficient, this algorithm for Boolean shape operations makes use of the continuity of a shape. It is fastest when special hardware performs the repetitious geometric computations.