A Unified Algorithm for Boolean Shape Operations

@article{Yamaguchi1984AUA,
  title={A Unified Algorithm for Boolean Shape Operations},
  author={Fujio Yamaguchi and Toshiya Tokieda},
  journal={IEEE Computer Graphics and Applications},
  year={1984},
  volume={4},
  pages={24-37}
}
Most algorithms for Boolean shape operations are complicated, slow, and of limited applicability. This one, based on a triangulation of potentially intersecting faces, is relatively fast and simple. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES

C . Braid , " The Synthesis of Solids Bounded by Many Faces

  • F. Kimura, N. Kakishita
  • TIPS working group , " TIPS - I , " Institute of…
  • 1974

Kakishita, "A Unified Method for Processing Polyhedra,

  • M. Hosaka, F. Kimura
  • Proc. IFIP Congress,
  • 1974
2 Excerpts

Representations of Rigid Solids - Theory , Methods and Systems Stepwise Construction of Polyhedra in Geometric Modelling

  • K. W. Brodlie
  • Mathematical Methods in Computer Graphics and…

Similar Papers

Loading similar papers…