|
ABSTRACT
Constructive Solid Geometry (CSG) defines objects as Boolean combinations (CSG trees) of primitive solids. To display such objects, one must classify points on the surfaces of the primitive solids with respect to the resulting composite object, to test whether these points lie on the boundary of the composite object or not. Although the point classification is trivial compared to the surface classification (i.e., the computation 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 efficiency-improving techniques for classifying points in depth order. The different techniques are compared through experiments.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
BRONSVOORT, W. F., VAN WIJK, J. J., ANO JANSEN, F. W. Two methods for improving the efficiency of ray casting in solid modelling. Comput.-Aided Des. 16, 1 {1984), 51-55.
|
| |
3
|
|
| |
4
|
|
 |
5
|
|
| |
6
|
GOLOSTEIN, R. A., AND NAaEL, R. 3-D simulation. Simulation 16, I (1971), 25-31.
|
| |
7
|
JANSEN, F.W. A CSG list priority hidden-surface algorithm. In Proceedings Eurographics '85 Con{erence, Elsevier Science, New York, 1985, 51-62.
|
| |
8
|
JANSEN, F.W. A pixel-parallel hidden-surface algorithm for constructive solid geometry. In Proceedings Eurographics '86 Conference, Elsevier Science, New York, 1986, 29-40.
|
| |
9
|
KEDEM, G., AND HAMMOND, S. W. The point classifier: A VLSI processor for displaying complex two dimensional objects. {n Proceedings of the I985 Chapel Hill Conference on VLSI, Computer Science Press, Rockville, Md., 1985, 377-392.
|
 |
10
|
|
| |
11
|
NEWELL, M. E., NEWELL, R. G., AND SANCHA, T.L. A new approach to the shaded picture problem. In Proceedings o{ the ACM National Con{erence (1972). ACM, New York, 1972, 443-450.
|
| |
12
|
|
| |
13
|
OKINO, N., KAKAZU, Y., AND MOmMOTO, M. Extended depth-buffer algorithms for hiddensurface visualization. IEEE Comput. Gr. Appl. 4, 5 (1984), 79-88.
|
| |
14
|
PLUNKEq~r, D. J., AND BAILEY, M.J. The vectorization of a ray tracing algorithm for improved execution speed. IEEE Comput. Gr. Appl. 5, 8 (1985), 53-60.
|
 |
15
|
|
| |
16
|
ROS$1GNAC, J. R., AND REQUICHA, A. A.G. Depth-buffering display techniques for constructive solid geometry. IEEE Comput. Gr. Appl. 6, 9 (1986), 29-39.
|
 |
17
|
|
| |
18
|
ROTH, S.D. Ray casting for modeling solids. Cornput. Gr. Image Process. 18, 2 {1982), 109-144.
|
 |
19
|
|
 |
20
|
Hiroyuki Sato , Mitsuo Ishii , Keiji Sato , Morio Ikesaka , Hiroaki Ishihata , Masanori Kakimoto , Katsuhiko Hirota , Kouichi Inoue, Fast image generation of construcitve solid geometry using a cellular array processor, ACM SIGGRAPH Computer Graphics, v.19 n.3, p.95-102, Jul. 1985
|
| |
21
|
S~.ARS, K. H., AND MIDOLETICH, A.E. Set-theoretic volume model evaluation and pictureplane coherence. IEEE Cornput. Gr. AppL 4, 3 (1984), 41-46.
|
 |
22
|
|
| |
23
|
TILOVE, R. B. Set membership classification: A unified approach to geometric intersection problems. IEEE Trans. Comput. C-29, 10 (1980), 874-883.
|
| |
24
|
TILOVE, R. B., REQUICHA, A. A. G., AND HOPKINS, M.R. Efficient editing of solid models by exploiting structural and spatial locality. Comput.-Aided Geom. Des. l, 3 (1984), 227-239.
|
 |
25
|
|
 |
26
|
|
| |
27
|
WOODWARK, J. R., AND QUINLAN, K.M. Reducing the effect of complexity on volume model evaluation. Comput. Aided Des. 14, 2 (1982), 89-95.
|
| |
28
|
WIJK, J. J. VAN On new types of solid models and their visualization with ray tracing, Ph.D. dissertation, Delft University Press, 1986.
|
REVIEW
"A. R. Forrest : Reviewer"
Image generation by ray tracing is dominated by the cost of
evaluating the intersections of rays with geometric objects. For objects
and scenes modeled using constructive solid geometry, boundaries of
objects are not stored explicitly, and int
more...
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|