Efficient editing of solid models by exploiting structural and spatial locality

Tilove, Robert; Requicha, Aristides A. G.; Hopkins, Mark R.

doi:10.1016/0167-8396(84)90010-4

Cited by 15 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The number of primitives involved in the evaluation of the Boolean expression can be reduced by observing that, for the classification of a given intersection point, not all primitives are relevant [24]. For example, if two primitives do not intersect (spatially), then the classification of a point on one of the boundaries with respect to the other can be determined a priori.…”

Section: Efficiency Of the Depth-order Point Classificationmentioning

confidence: 99%

“…Tree pruning is often applied within the context of spatial locality [2,3,19,21,24,27]. For instance, any given cell of a regular space subdivision is not likely to be intersected by all the primitives of the CSG tree.…”

Section: Spatial Localitymentioning

confidence: 99%

“…Efficiency-improving techniques based on exploiting spatial and structural relationships are described in [24] and in [16,17].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Depth-order point classification techniques for CSG display algorithms

Jansen

1991

ACM Trans. Graph.

View full text Add to dashboard Cite

Constructive. Solid Geometry (CSG) defines objects as Boolean combhations(CSG trees) of primitive solids. To display such objects, one must classify pointa on the surfacea of the primitive solids with respect to the resulting composite object, to test whether these pointa lie on the boundary of the composite object or not. Although the point classification is trivial compared to the surface claeeification (i.e., the computation of the portion of the faces of primitive solids that lie on the boundary of the composite object), for CSG models with a large number of primitive solids (large CSG trees), the point classification may still consume a considerable fraction of the total processing time. This paper presents an overview of existing and new eficiency-improving techniques for classifying pointa in depth order. The different techniques are compared through experiments.

show abstract

Section: Efficiency Of the Depth-order Point Classificationmentioning

confidence: 99%

Section: Spatial Localitymentioning

confidence: 99%

See 1 more Smart Citation

Depth-order point classification techniques for CSG display algorithms

Jansen

1991

ACM Trans. Graph.

View full text Add to dashboard Cite

show abstract

“…Nowadays, the hardware configure of computer in not good in vocation-technical education institute. To achieve real time Boolean operations, you need to make improvements in Three-dimensional data structure is used to build geometric model in the computer, and can determine by modeling examination to prove the validity of such geometry consistent with the definition of regular geometry [3] . Geometry is the most commonly used solid modeling, which is the boundary representation (B-reps) to represent [2 � The regular Boolean operations of solid modeling solve that the two objects (such as, object A and object B) can generate a new object after operation.…”

Section: Introductionmentioning

confidence: 99%