Results 1  10
of
1,075,336
Speedups in Constructive Solid Geometry
, 1992
"... We convert constructive solid geometry input to explicit representations of polygons, polyhedra, or more generally ddimensional polyhedra, in time O(n d ), improving a previous O(n d log n) bound. We then show that any Boolean formula can be preprocessed in time O(n log n/ log log n) so tha ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We convert constructive solid geometry input to explicit representations of polygons, polyhedra, or more generally ddimensional polyhedra, in time O(n d ), improving a previous O(n d log n) bound. We then show that any Boolean formula can be preprocessed in time O(n log n/ log log n) so
Constructive Solid Geometry for Polyhedral Objects
, 1986
"... Constructive Solid Geometry (CSG) is a powerful way of describing solid objects for computer graphics and modeling. The surfaces of any primitive object (such as a cube, sphere or cylinder) can be approximated by polygons. Being abile to find the union, intersection or difference of these objects al ..."
Abstract

Cited by 45 (1 self)
 Add to MetaCart
Constructive Solid Geometry (CSG) is a powerful way of describing solid objects for computer graphics and modeling. The surfaces of any primitive object (such as a cube, sphere or cylinder) can be approximated by polygons. Being abile to find the union, intersection or difference of these objects
Constructive Solid Geometry for Triangulated Polyhedra
, 1990
"... Triangulated polyhedra are simpler to process than arbitrary polyhedra for many graphics operations. Algorithms that compute the boundary representation of a constructive solid geometry (csg) model, however, may perform poorly if the model involves triangulated polyhedral primitives. A new csg al ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Triangulated polyhedra are simpler to process than arbitrary polyhedra for many graphics operations. Algorithms that compute the boundary representation of a constructive solid geometry (csg) model, however, may perform poorly if the model involves triangulated polyhedral primitives. A new csg
Constructive Solid Geometry Using Algorithmic Skeletons
, 1996
"... This paper presents a study in the use of parallel algorithmic skeletons to program applications of constructive solid geometry (CSG). ..."
Abstract
 Add to MetaCart
This paper presents a study in the use of parallel algorithmic skeletons to program applications of constructive solid geometry (CSG).
Fast Constructive Solid Geometry Display
 in the PixelPower Graphics System, ACM SIGGRAPH '86 Proc., Computer Graphics
, 1986
"... We present two Mgorithms for the display of CSGdefined objects on PixelPowers, an extension of the PixelPlanes logicenhanced memory architecture, which calculates for each and every pixel on the screen (in parallel) the value of any quadratic function in the screen coordinates (x,y). The first ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
We present two Mgorithms for the display of CSGdefined objects on PixelPowers, an extension of the PixelPlanes logicenhanced memory architecture, which calculates for each and every pixel on the screen (in parallel) the value of any quadratic function in the screen coordinates (x,y). The first algorithm restructures any CSG tree into an equivalent, but possibly larger, tree whose display can be achieved by the second algorithm. The second algorithm traverses the restructured tree and generates quadratic coefficients and opcodes for PixelPowers. These opcodes instruct PixelPowers to generate the boundaries of primitives and perform set operations using the standard Zbuffer algorithm. Several externallysupplied CSG data sets have been processed with the new treetraversal algorithm and an associated PixelPowers simulator. The resulting images indicate that good results can be obtained very rapidly with the new system. For example, the commonly used MBB test part (at right) with 24 primitives is translated into approximately 1900 quadratic equations. On a PixelPowers system running at 10MHz (the speed at which our current PixelPlanes memories run), the image should be rendered in about 7.5 milliseconds.
A Polymorphic Library for Constructive Solid Geometry
, 1994
"... Solid modelling using constructive solid geometry (CSG) includes many examples of stylised divideandconquer algorithms. We identify the sources of these recurrent patterns and implement a Geometric Evaluation Library (GEL) which captures them as higher order functions. This library then become ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Solid modelling using constructive solid geometry (CSG) includes many examples of stylised divideandconquer algorithms. We identify the sources of these recurrent patterns and implement a Geometric Evaluation Library (GEL) which captures them as higher order functions. This library then become
Refinement Methods for Geometric Bounds in Constructive Solid Geometry
 ACM Transactions on Graphics
, 1991
"... In Constructive Solid Geometry, geometric solids are represented as trees whose leaves are labelled by primitive solids and whose internal nodes are labelled by settheoretic operations. A bounding function in this context is an upper or lower estimate on the extent of the constituent sets; such bou ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
In Constructive Solid Geometry, geometric solids are represented as trees whose leaves are labelled by primitive solids and whose internal nodes are labelled by settheoretic operations. A bounding function in this context is an upper or lower estimate on the extent of the constituent sets
Polygonization of Implicit Surfaces with Constructive Solid Geometry
, 1996
"... A polygonisation algorithm is presented which extends an existing skeletal implicit surface technique to include operations based on Constructive Solid Geometry between blended groups of implicit surface objects. The result is a surface definition (to be called Boolean Compound Soft Object, orBCSO f ..."
Abstract
 Add to MetaCart
A polygonisation algorithm is presented which extends an existing skeletal implicit surface technique to include operations based on Constructive Solid Geometry between blended groups of implicit surface objects. The result is a surface definition (to be called Boolean Compound Soft Object, or
Constructive Solid Geometry Operators for the Isoluminance Contour Model
"... Isoluminance contouring [Conw88a, Conw88b] is a representational scheme which supports a rendering technique combining the speed of flat shading and the visual realism of nonrecursive raytracing. This paper presents extensions to the method which implement a full solid constructive geometry scheme ..."
Abstract
 Add to MetaCart
Isoluminance contouring [Conw88a, Conw88b] is a representational scheme which supports a rendering technique combining the speed of flat shading and the visual realism of nonrecursive raytracing. This paper presents extensions to the method which implement a full solid constructive geometry
Constructive Solid Geometry Operators for the Isoluminance Contour Model
"... Isoluminance contouring [Conw88a, Conw88b] is a representational scheme which supports a rendering technique combining the speed of flat shading and the visual realism of nonrecursive raytracing. This paper presents extensions to the method which implement a full solid constructive geometry scheme ..."
Abstract
 Add to MetaCart
Isoluminance contouring [Conw88a, Conw88b] is a representational scheme which supports a rendering technique combining the speed of flat shading and the visual realism of nonrecursive raytracing. This paper presents extensions to the method which implement a full solid constructive geometry
Results 1  10
of
1,075,336