Counting circular arc intersections

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Counting circular arc intersections

Full text

Pdf (1.00 MB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the seventh annual symposium on Computational geometry table of contents

North Conway, New Hampshire, United States

Pages: 10 - 20

Year of Publication: 1991

ISBN:0-89791-426-0

Authors

Pankaj K. Agarwal	Computer Science Department, Duke University, Durham, NC
Micha Sharir	School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel and Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, New York, NY

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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

	Ag1	Pankaj K. Agarwal, Partitioning arrangements of lines, part I: an efficient deterministic algorithm, Discrete & Computational Geometry, v.5 n.5, p.449-483, 1990 [doi>10.1007/BF02187805]
	Ag2	Pankaj K. Agarwal, Partitioning arrangements of lines, part II: applications, Discrete & Computational Geometry, v.5 n.6, p.533-573, Sep. 1990 [doi>10.1007/BF02187809]
	AASS	Pankaj K. Agarwal , Boris Aronov , Micha Sharir , Subhash Suri, Selecting distances in the plane, Proceedings of the sixth annual symposium on Computational geometry, p.321-331, June 07-09, 1990, Berkley, California, United States [doi>10.1145/98524.98597]
	AS	K P Agarwal , Micha Sharir, Counting Circular Arc Intersections, Duke University, Durham, NC, 1991
	BO	3.L. Bentley and T. Ottman, Algorithms for reporting and counting geometric intersections, IEEE Trans. on Computers C-28 (1979), 643- 647.
	Ch	Bernard Chazelle, Reporting and counting segment intersections, Journal of Computer and System Sciences, v.32 n.2, p.156-182, April 1986 [doi>10.1016/0022-0000(86)90025-5]
	CE	B. ChazeIle ~nd H. Edelsbrunner, An optimal algorithm for intersecting line segments in the plane, Proceedings 29th Annual IEEE Symposium on Foundations of Computer Science, 1989, pp. 590-600.
	CEGS1	Bernard Chazelle , Herbert Edelsbrunner , Leonidas J. Guibas , Micha Sharir, A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications, Proceedings of the 16th International Colloquium on Automata, Languages and Programming, p.179-193, July 11-15, 1989
	CEGS2	B. Chazelle, H. Edelsbrunner, L. Guibas and M. Shark, Algorithms for bichromatic line segment problems and polyhedral terrains, Manuscript, 1990.
	CS1	B. Chazelle , M. Sharir, An algorithm for generalized point location and its applications, Journal of Symbolic Computation, v.10 n.3-4, p.281-309, Sept./Oct. 1990 [doi>10.1016/S0747-7171(08)80065-X]
	CSW	Bernard Chazelle , Micha Sharir , Emo Welzl, Quasi-optimal upper bounds for simplex range searching and new zone theorems, Proceedings of the sixth annual symposium on Computational geometry, p.23-33, June 07-09, 1990, Berkley, California, United States [doi>10.1145/98524.98532]
	Cl	K. Clarkson, New applications of random sampling in computational geometry, Discrete and Computational Geometry 2 (1987), 195-222.
	CEGSW	Kenneth L. Clarkson , Herbert Edelsbrunner , Leonidas J. Guibas , Micha Sharir , Emo Welzl, Combinatorial complexity bounds for arrangements of curves and spheres, Discrete & Computational Geometry, v.5 n.2, p.99-160, 1990 [doi>10.1007/BF02187783]
	CS2	K. L. Clarkson , P. W. Shor, Applications of random sampling in computational geometry, II, Discrete & Computational Geometry, v.4 n.5, p.387-421, 1989 [doi>10.1007/BF02187740]
	Ed	Herbert Edelsbrunner, Algorithms in combinatorial geometry, Springer-Verlag New York, Inc., New York, NY, 1987
	EGS	Herbert Edelsbrunner , Lionidas J Guibas , Jorge Stolfi, Optimal point location in a monotone subdivision, SIAM Journal on Computing, v.15 n.2, p.317-340, May 1986 [doi>10.1137/0215023]
	GOS	L. Guibas, M. Overmars and M. Shark, Counting and reporting intersections in arrangements of line segments, Technical Report 434, Dept. Computer Science, New York University, March 1989.
	HW	D. Haussler and E. Welzl, e-nets and simplex range queries, Discrete and Computational Geometry 2 (1987), 127-151.
	Mat1	Jiří Matoušek, Construction of &egr;-nets, Discrete & Computational Geometry, v.5 n.5, p.427-448, 1990 [doi>10.1007/BF02187804]
	Mat2	Jiří Matoušek, Cutting hyperplane arrangements, Proceedings of the sixth annual symposium on Computational geometry, p.1-9, June 07-09, 1990, Berkley, California, United States [doi>10.1145/98524.98528]
	Mu	K. Mulmuley, A fast planar partition algorithm, I, Proceedings 29ta Annual IEEE Symposium on Foundations of Computer Science, 1988, pp. 580- 589.