Determination of mass properties of polygonal CSG objects in parallel

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Determination of mass properties of polygonal CSG objects in parallel

Full text

Pdf (1.01 MB)

Source

ACM Symposium on Solid and Physical Modeling archive
Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications table of contents

Austin, Texas, United States

Pages: 279 - 288

Year of Publication: 1991

ISBN:0-89791-427-9

Authors

Chandrasekhar Narayanaswami	IBM Austin, 11400 Burnet Road, Austin, Texas and Electrical, Computer and Systems Engineering Dept., Rensselaer Polytechnic Institute, Troy, New York
William Randolph Franklin	Electrical, Computer and Systems Engineering Dept., Rensselaer Polytechnic Institute, Troy, New York

Sponsor

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

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 9, Downloads (12 Months): 13, Citation Count: 0

Additional Information:

references 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/112515.112550 What is a DOI?

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	V. Akman , W. R. Franklin , M. Kankanhalli , C. Narayanaswmi, Geometric computing and uniform grid technique, Computer-Aided Design, v.21 n.7, p.410-420, Sep. 1989 [doi>10.1016/0010-4485(89)90125-5]
	2	T. Asano, M. Edahiro, H. Imai, M. Iri, and K. Murota. Practical Use o} Bucketing Techniques in Computational Geometry, volume 2 of Machine Intelligence and Pattern Recognition, pages 153-195. Elsevier Science Publishers, 1985.
	3	H. Edelsbrunner , E. P. Mücke, Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms, Proceedings of the fourth annual symposium on Computational geometry, p.118-133, June 06-08, 1988, Urbana-Champaign, Illinois, United States [doi>10.1145/73393.73406]
	4	S. J. Eggers , R. H. Katz, The effect of sharing on the cache and bus performance of parallel programs, Proceedings of the third international conference on Architectural support for programming languages and operating systems, p.257-270, April 03-06, 1989, Boston, Massachusetts, United States
	5	w. 1~. Franklin. Gombinatorics of Hidden ~urfavv AlgQ- rithms. PhD thesis, Center for Research in Computing Technology, Harvard University, June 1978.
	6	W. R. Franklin. Vertex Based Polyhedron Formulae. (submitted for publication), November 1988.
	7	Michael T. Goodrich, Applying parallel processing techniques to classification problems in constructive solid geometry, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.118-128, January 22-24, 1990, San Francisco, California, United States
	8	D. E. Knuth. Surreal Numbers: How Two Ex-students Turned on to Pure Mathematics and Found Total Happiness: A Mathematical Novelette. Addison-Wesley, 1974.
	9	Yong Tsui Lee , Aristides A. G. Requicha, Algorithms for computing the volume and other integral properties of solids. II. A family of algorithms based on representation conversion and cellular approximation, Communications of the ACM, v.25 n.9, p.642-650, Sept 1982 [doi>10.1145/358628.358648]
	10	S. L. Lien and J. T. Kajiya. A Symbolic Method for Calculating the Integral Properties of Arbitrary Nonconvex Polyhedra. IEEE Computer Graphics and Applications, pages 43-51, October 1984.
	11	D. J. Meagher. Geometric Modelling Using Octree Encoding. Computer Graphics and Image Processing, 19:129-147, June 1982.
	12	G. L. Miller and J. H. Reif. Parallel Tree Contraction and its Application. In Proceedings of the 26th IEEE Symposium of Foundations of Computer Science, pages 478-489, 1985.
	13	Chandrasekhar Narayanaswami, Parallel processing for geometric applications, Rensselaer Polytechnic Institute, Troy, NY, 1992
	14	Chandrasekhar Narayanaswami, Parallel processing for geometric applications, Rensselaer Polytechnic Institute, Troy, NY, 1992
	15	C. Narayanaswami and M. Seshan. The Efficiency of the Uniform Grid for Computing Intersections. Master's thesis, Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic institute, Troy, NY, December 1987.
	16	D. Pullar. Comparative Study of Algorithms for Reporting Geometrical Intersections. In Proceedings of the International Symposium on Spatial Data Handling, pages 66-75, Zurich, July 1990.
	17	A. A. G. Requicha and H. B. Voelcker. Boolean Operation in Solid Modeling" Boundary Evaluation and Merging Algorithms. In Proceedings of the IEEE, volume 73, pages 30-44, January 1985.
	18	Jaroslaw R. Rossignac , Herbert B. Voelcker, Active zones in CSG for accelerating boundary evaluation, redundancy elimination, interference detection, and shading algorithms, ACM Transactions on Graphics (TOG), v.8 n.1, p.51-87, Jan. 1989 [doi>10.1145/49155.51123]
	19	Hanan Samet , Robert E. Webber, Hierarchical Data Structures and Algorithms for Computer Graphics. Part I., IEEE Computer Graphics and Applications, v.8 n.3, p.48-68, May 1988 [doi>10.1109/38.513]