(in WR Franklin → Research)

These representations use little or no global topology. This contrasts with the complete topologies used in many CAD systems. My local data structure simplifies many operations, such as determination of the mass properties of boolean combinations of objects. That simplifies many operations, such as determination of the mass properties of boolean combinations of objects. There are fewer special cases, and parallel processing is facilitated.

These local representations have various applications, such as computing mass properties of boolean operations on large sets of polyhedra, typically in linear time. More details are in UNION2, UNION3, and Boolean Operations and Their Mass Properties.

Papers include:

1. . WR Franklin, Sept 1992. (unpublished talk). (URL)
2. . WR Franklin, N. Chandrasekhar, M. Kankanhalli and V. Akman, 1988. (paper).
   Talk.
3. . Wm Randolph Franklin. In Proc. 3rd Annu. ACM Sympos. Comput. Geom., pages 110-118, 1987. (paper).
   Paper.
4. . Wm Randolph Franklin. Computer Graphics and Image Processing, 22:327-338, 1983. (paper).

<< Uniform Grid | Research Page List | Connected Components >>