Invertible Set Operations for Solid Modeling
The paper describes a method of representing the solid design process using a tree data structure. Previous stages in the development of a design can be quickly regenerated by specifying nodes of this tree. A detailed description of the implementation of invertible set operations is also presented.
KeywordsComputer Graphic Previous Stage Union Operation Primitive Operation Tree Data Structure
Unable to display preview. Download preview PDF.
- B. G. Baumgart, A Polyhedron Representation for Computer Vision, AFIPS Conf. Proc., Vol.44, pp.589–596, May 1975.Google Scholar
- I. C. Braid, R.C. Hillyard and I.A. Stroud, Stepwise Construction of Polyhedra in Geometric Modelling, Mathematical Methods in Computer Graphics and Design (Ed. by K.W. Brodlie) Academic Press, pp.123–141, 1980.Google Scholar
- H. Chiyokura and F. Kimura, A Representation of Solid Design Process using Basic Operations, in Frontiers in Computer Graphics — Proc. Computer Graphics Tokyo 84, T. L. Kunii, ed., Springer- Verlag, Heidelberg, 1985, pp. 26–43.Google Scholar
- M. Mantyla, Computational Topology: A Study of Topological Manipulations and Interrogations in Computer Graphics and Geometric Modeling, Acta Polytechnica Scandinavica, Mathematics and Computer Science Series No.37, Helsinki 1983.Google Scholar