Efficient parallel evaluation of CSG tree using fixed number of processors

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Efficient parallel evaluation of CSG tree using fixed number of processors

Full text

Pdf (921 KB)

Source

ACM Symposium on Solid and Physical Modeling archive
Proceedings on the second ACM symposium on Solid modeling and applications table of contents

Montreal, Quebec, Canada

Pages: 137 - 146

Year of Publication: 1993

ISBN:0-89791-584-4

Authors

Raja P. K. Banerjee
Vineet Goel
Amar Mukherjee

Sponsor

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

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 6, Citation Count: 2

Additional Information:

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/164360.164409 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.

	Abra89	K. Abrahamson , N. Dadoun , D. G. Kirkpatrick , T. Przytycka, A simple parallel tree contraction algorithm, Journal of Algorithms, v.10 n.2, p.287-302, June 1989 [doi>10.1016/0196-6774(89)90017-5]
	Bren74	Richard P. Brent, The Parallel Evaluation of General Arithmetic Expressions, Journal of the ACM (JACM), v.21 n.2, p.201-206, April 1974 [doi>10.1145/321812.321815]
	BBN	Programming in C with Uniform System, BBN Advaaaced Computer Inc.
	Came89	Stephen Cameron, Efficient intersection tests for objects defined constructively, International Journal of Robotics Research, v.8 n.1, p.3-25, February 1989 [doi>10.1177/027836498900800101]
	Cole86	Cole. R, Vishkin. U, "Approximate and exact parallel scheduling with applications to list, tree and graph problems, Proc. 27th Annual IEEE Syrup. on Foundations of Comp. Sci., 1986, pp. 478-491.
	Gibo86	A. M. Gibbons , W. Rytter, A Optimal Parallel Algorithm for Dynamic Epression Evaluation and its Applications, University of Warwick, Coventry, UK, 1986
	Good90	M. Goodrich , M. Ghouse , J. Bright, Generalized sweep methods for parallel computational geometry, Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, p.280-289, July 02-06, 1990, Island of Crete, Greece [doi>10.1145/97444.97695]
	Kede89	Kedem. G., Ellis, J.L., "The ray-casting machine", Parallel Processing for Computer Vision and Display, eds. P.M. Dew, R.A. Ewinshaw, T.R. Heywood, Addison Wesly, 1989.
	Kosa89	S. R. Kosaraju , A. L. Delcher, Optimal parallel evaluation of tree-structured computations by raking (extended abstract), VLSI Algorithms and Architectures, Springer-Verlag, London, 1988
	Mill85	Miller. G.L. and Reif J.H., "Parallel Tree Contraction and Its Applications", Proc. 26th Symp. Found. Comp. Sci., pp. 478-489, 1985.
	Requ83	Requicha, A. A. G., Voelcker. H.B., "Solid Modelling: Current Status and Research Directions", IEEE Computer Graphics aald Applications, October 1983, pp.25-37.
	Ross89	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]
	Tar85	Tarjan, R. E., and Visl~dn, U., "Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time" SIAM J. Computing, 14(4):862-874, 1985.
	Tilo80	Tilove, R.B., "Set Membership classification. A unified approach to .qeometric intersection problems", IEEE Trans. Comput. vol C-29, no 10. Oct. 1980.
	Tilo84	Robert B. Tilove, A null-object detection algorithm for constructive solid geometry, Communications of the ACM, v.27 n.7, p.684-694, July 1984 [doi>10.1145/358105.358195]
	Wood88	John R. Woodwark, Eliminating Redundant Primitives from Set-Theoretic Solid Models by a Consideration of Constituents, IEEE Computer Graphics and Applications, v.8 n.3, p.38-47, May 1988 [doi>10.1109/38.512]
	Zeid91	Ibrahim Zeid, CAD/Cam Theory and Practice, McGraw-Hill Higher Education, 1991

CITED BY 2

	John Hable , Jarek Rossignac, Blister: GPU-based rendering of Boolean combinations of free-form triangulated shapes, ACM Transactions on Graphics (TOG), v.24 n.3, July 2005
	Kiminori Matsuzaki , Zhenjiang Hu , Masato Takeichi, Towards automatic parallelization of tree reductions in dynamic programming, Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, July 30-August 02, 2006, Cambridge, Massachusetts, USA