Jansen, Frederik W. "Depth-Order Point Classification Techniques for CSG Display Algorithms." ACM TOG, Vol. 10, #1, January 1991, p. 40-70. f27g  Home/Search   Document Not in Database   Summary   Related Articles   Check

....range of modifications that can be done on the object. Many methods were suggested for CSG display using special purpose hardware. These methods have progressed from a special kind of z buffer [Okino84, VanHook86, Rossignac86] to usage of multiple z and frame buffers and multiple rendering passes [Goldfeather86, Jansen86, Jansen87, Goldfeather89, Rossignac90, Jansen91]. These methods do support real time rendering of CSG models (naturally, depending upon the model size) but are not practical for every day use because they require expensive special purpose hardware that is not easily available. Wiegand96] presents a method to emulate the algorithm of ....

Jansen, F.W., Depth-order point classification techniques for CSG display algorithms, ACM Trans. on Graphics, 10(1):40--70, 1991.

....and analyze realistic geometric objects easily and efficiently is an important goal of geometric modeling. One representation for geometric objects that has received much attention of late, relative to this goal, is the Constructive Solid Geometry (CSG) representation (e.g. see [46] or [34]) An object is represented in this model by a set of primitive objects that are hierarchically combined according to various set operations, such as intersection, union, subtraction, and exclusive union (i.e. all points in one or the other, but not both) See Figure 1. This hierarchical ....

....that benefit from being given a balanced tree. Perhaps the most important such computation is line classification [55, 56] determining the intersections of a line with an object defined by a CSG representation, for it is the primitive computation used in many CSG rendering algorithms [26, 28, 34, 38, 46, 48]. 1.1 Our Results In this paper we show how to convert any CSG tree T into a functionally equivalent balanced tree D of roughly the same size as T , and we show how this leads to a method for line classification in a CSG model that runs in O(n log n) time, which is optimal and improves the ....

[Article contains additional citation context not shown here]

F. W. Jansen, "Depth-order point classification techniques for CSG display algorithms," ACM Trans. on Graphics, 10(1), 40--70, 1991.

No context found.

Jansen, Frederik W. "Depth-Order Point Classification Techniques for CSG Display Algorithms." ACM TOG, Vol. 10, #1, January 1991, p. 40-70. f27g

No context found.

F. W. Jansen, "Depth-order point classification techniques for CSG display algorithms", ACM Transactions on Graphics, 10(1), pp. 40-- 70 (1991).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC