A unified approach to interference problems using a triangle processor

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A unified approach to interference problems using a triangle processor

Full text

Pdf (679 KB)

Source

International Conference on Computer Graphics and Interactive Techniques archive
Proceedings of the 12th annual conference on Computer graphics and interactive techniques table of contents

Pages: 141 - 149

Year of Publication: 1985

ISBN:0-89791-166-0

Also published in ...

Author

Fujio Yamaguchi

Kyushu Institute of Design, Fukuoka, Japan, 4-9-1, Shiobaru, Minami-ku, Fukuoka 815 Japan

Sponsor

SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 22, Citation Count: 3

Additional Information:

abstract references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/325334.325224 What is a DOI?

ABSTRACT

Triangulation is an efficient way to simplify and unify interference problems, such as hidden line and surface elimination and Boolean shape operations in solid modeling. Almost all of the processing relevant to a triangle can be performed by computing some 4 x 4 determinants. The author proposes a hardware processor (TRIANGLE PROCESSOR) that quickly intersects a triangle with a point, a line segment, or another triangle. Various applications of the TRIANGLE PROCESSOR are explained in this paper, including applications to face and volume triangulations.The author stresses that the triangulation approach and the TRIANGLE PROCESSOR simplify, speed up and unify various types of processing relating to interference.

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	Watkins, G.S. : A Real-Time Visible Surface Algorithm, Univ. of Utah Comput. Sci. Dept., UTEC-CSc-70-101, June 1970.
	2	Yamaguchi, Fujio & Toshiya Tokieda : A Visible Line and Surface Detection Algorithm Created Through a Taxonomical Study, Proceeding of CAD/CAM, Robotics and Automation Conference, Arizona, 1985. Arizona, 1985.
	3	Yamaguchi, Fujio & Toshiya Tokieda : AUnified Algorithm for Boolean Shape Operations, 1EEE Computer Graphics and Applications, Vol.4, No.6 (June) 1984.
	4	in preparation.
	5	Yoneda, K., M. Muramatsu & F. Yamaguchi : Determining Intersections between two Free Form Bodies Using the TRIANGLE PROCESSOR, Spring Conference of the Japan Society of Precision Engineering, 1985.
	6	see "INTERACTIVE COMPUTER GRAPHICS" by Giloi, Prentice-Hall, 1978.
	7	in preparation.
	8	Wordenweber, Burkard : Surface Triangulation for Picture Production, 1EEE Computer Graphics and Applications, Vol.3, No.8 (Nov.), 1983.
	9	Lewis, B.A. and J.S. Robinson : Triangulation of Planar Regions with Applications, Computer Journal, Vol.21, No.4, 1979.
	10	Wordenweber, Burkard : Volume Triangulation, CAD group document 110, Computer Laboratory, Cambridge University, 1980.

CITED BY 3

	Masatoshi Niizeki , Fujio Yamaguchi, Projectively invariant intersection detections for solid modeling, ACM Transactions on Graphics (TOG), v.13 n.3, p.277-299, July 1994
	Jarek Rossignac , Abe Megahed , Bengt-Olaf Schneider, Interactive inspection of solids: cross-sections and interferences, ACM SIGGRAPH Computer Graphics, v.26 n.2, p.353-360, July 1992
	Pascal Volino , Martin Courchesne , Nadia Magnenat Thalmann, Versatile and efficient techniques for simulating cloth and other deformable objects, Proceedings of the 22nd annual conference on Computer graphics and interactive techniques, p.137-144, September 1995