Parallel algorithms for arrangements

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Parallel algorithms for arrangements

Full text

Pdf (929 KB)

Source

ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the second annual ACM symposium on Parallel algorithms and architectures table of contents

Island of Crete, Greece

Pages: 298 - 306

Year of Publication: 1990

ISBN:0-89791-370-1

Authors

R. Anderson	Department of Computer Science and Engineering, FR-35, University of Washington, Seattle, Washington
P. Beame	Department of Computer Science and Engineering, FR-35, University of Washington, Seattle, Washington
E. Brisson	Department of Computer Science and Engineering, FR-35, University of Washington, Seattle, Washington

Sponsors

IEEE-CS : Computer Society
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
CTI : Computer Technology Inst.
EATCS : European Association for Theoretical Computer Science
Computer Tech Inst. : Computer Technology Institute

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions 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/97444.97697 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	A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing, and C. K. Yap. Parallel computational geometry. Algorithmica, 3:293-326, 1988.
	2	A. Aggarwal and J. Wein. Computational geometry" Lecture notes for 18.409, spring 1988. Technical report, MIT Laboratory for Computer Science, 1988. Technical Report MIT/LCS/RSS 3.
	3	Dennis S. Arnon , George E. Collins , Scott McCallum, Cylindrical algebraic decomposition I: the basic algorithm, SIAM Journal on Computing, v.13 n.4, p.865-877, Nov. 1984 [doi>10.1137/0213054]
	4	M. J. Atallah, R. Cole, and M. T. Goodrich. Cascading divide-and-conquer: A technique for designing parallel algorithms. In 28th Symposium on Foundations of Computer Science, pages 151-160, 1987.
	5	J. Canny. A new algebraic method for robot motion planning and real geometry. In 28th Symposium on Foundations of Computer Science, pages 29-38, 1987.
	6	Bernard Chaselle, Intersecting is easier than sorting, Proceedings of the sixteenth annual ACM symposium on Theory of computing, p.125-134, December 1984 [doi>10.1145/800057.808674]
	7	B. Chazelle, L. J. Guibas, and D. T. Lee. The power of geometric duality. In 24th Symposium on Foundations of Computer Science, pages 217-225, 1983.
	8	R. Cole and U. Vishkin. Approximate scheduling, exact scheduling, and applications to parallel algorithms. In 27th Symposium on Foundations of Computer Science, pages 478-491, 1986. Part I to appear in SIAM Journal of Computing.
	9	James R. Driscoll , Neil Sarnak , Daniel D. Sleator , Robert E. Tarjan, Making data structures persistent, Journal of Computer and System Sciences, v.38 n.1, p.86-124, February 1989 [doi>10.1016/0022-0000(89)90034-2]
	10	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]
	11	M. T. Goodrich, Intersecting line segments in parallel with an output-sensitive number of processors, Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, p.127-137, June 18-21, 1989, Santa Fe, New Mexico, United States [doi>10.1145/72935.72950]
	12	Michael McKenna, Worst-case optimal hidden-surface removal, ACM Transactions on Graphics (TOG), v.6 n.1, p.19-28, Jan. 1987 [doi>10.1145/27625.27627]
	13	J. H. Reif , S. Sen, Polling: a new randomized sampling technique for computational geometry, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.394-404, May 14-17, 1989, Seattle, Washington, United States [doi>10.1145/73007.73045]
	14	A. Tarski. A decision method.for elementary algebra and geometry. University of California Press, Berkeley, 1951.