An efficient algorithm for CSG to b-rep conversion

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An efficient algorithm for CSG to b-rep conversion

Full text

Pdf (1.05 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: 99 - 108

Year of Publication: 1991

ISBN:0-89791-427-9

Author

Maged S. Tawfik

3D/Eye Inc., 2359 N. Triphammer Rd., Ithaca, NY

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): 26, Citation Count: 1

Additional Information:

references cited by index terms

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.112534 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	E. Brisson, Representing geometric structures in d dimensions: topology and order, Proceedings of the fifth annual symposium on Computational geometry, p.218-227, June 05-07, 1989, Saarbruchen, West Germany [doi>10.1145/73833.73858]
	2	Herbert Edelsbrunner, Algorithms in combinatorial geometry, Springer-Verlag New York, Inc., New York, NY, 1987
	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	H Edelsbrunner , J O'Rouke , R Seiel, Constructing arrangements of lines and hyperplanes with applications, SIAM Journal on Computing, v.15 n.2, p.341-363, May 1986 [doi>10.1137/0215024]
	5	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
	6	P. Lienhardt, Subdivisions of n-dimensional spaces and n-dimensional generalized maps, Proceedings of the fifth annual symposium on Computational geometry, p.228-236, June 05-07, 1989, Saarbruchen, West Germany [doi>10.1145/73833.73859]
	7	M~intyl~i, M., An Introdttction to Solid Modeling, Computer Science Press, Rockwille, MD, 1988.
	8	Ottmann, T., Wildmayer, P., and Wood, D., "A Fast Algorithm for the Boolean Masking Problem," Computer Vision, Graphics, and bnage Processing, Vol. 30, 1985, pp. 249-268.
	9	Requicha, A. A. G., and Voelcker, H. B., "Constructive Solid Geometry", Technical Memo. 25, Production Automation Project, University of Rochester, N_~., NI~,.,_ 1077_ (Repc~rt~ t~f the Peodueticwt Autc~mation Project are no longer available from the University of Rochester, but may be obtained from CPA, 304 Kimball Hall, Cornell University, Ithaca, NY 14853.)
	10	Requicha, A. A. G, and Voelcker, H. B., "Boolean Operations in Solid Modelling: Boundary Evaluation and Merging Algorithms," Proc. IEEE, Vol. 73, No. 1, Jan. 1985, pp. 30-44.
	11	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]
	12	D. Salesin , J Stolfi , L. Guibas, Epsilon geometry: building robust algorithms from imprecise computations, Proceedings of the fifth annual symposium on Computational geometry, p.208-217, June 05-07, 1989, Saarbruchen, West Germany [doi>10.1145/73833.73857]
	13	Tilove, R. B., "Set Membership Classification: A Unified Approach to Geometric Intersection Problems," IEEE Trans. on Computers, Vol. C-29, No. 10, Oct. 1980, pp. 874-883.
	14	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]
	15	Zaslavsky, T., Facing up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes, Memoirs of the American Mathematical Society, Vol. 1, No. 154, }an. 19"/5.