On the sum of squares of cell complexities in hyperplane arrangements

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On the sum of squares of cell complexities in hyperplane arrangements

Full text

Pdf (559 KB)

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: 307 - 313

Year of Publication: 1991

ISBN:0-89791-426-0

Authors

Boris Aronov	Department of Computer Science, Polytechnic University, Brooklyn, NY
Jiří Matoušek	Department of Applied Mathematics, Charles University, 118 00 Praha 1, Czechoslovakia
Micha Sharir	School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel and Courant Institute of Mathematical Sciences, New York University, 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): 2, Downloads (12 Months): 10, Citation Count: 3

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

	AA	P.K. AGARWAL AND B. ARONOV, Counting facets and incidences, Technical Report 90-38, DIMACS Center, Piscataway, NJ, 1990. To appear in Discrete and Computational Geometry.
	AS90	B. ARoNov ANO M. SHARIR, Triangles in space or building (and analyzing) castles in the air, Combinatorica 10 (1990), 137-173.
	AS91	B. ARoNov ANo M. SHARIR, On the zone of an algebraic surface in a hyperplane arrangement, in preparation.
	AS91b	B. ARONOV ANO M. SnaRnt, On the complexity of a single cell in an arrangement of simplices in d-space, in preparation.
	CF	B. CHAZELLE AND J. FRmOMAN, Point 1ocation among hyperplanes, manuscript, 1991.
	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]
	CS	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]
	E	Herbert Edelsbrunner, Algorithms in combinatorial geometry, Springer-Verlag New York, Inc., New York, NY, 1987
	EGS	Herbert Edelsbrunner , Leonidas Guibas , Micha Sharir, The complexity of many cells in arrangements of planes and related problems, Discrete & Computational Geometry, v.5 n.2, p.197-216, 1990 [doi>10.1007/BF02187785]
	ESS	H. EDELSBRUNNER, R. SEIDEL AND M. S~ARm, New proofs of the zone theorem for arrangements of hyperplanes, in preparation.
	P90	M. PELLEGItlNI, Personal communication, 1990.
	P91a	M. PELLEaltlNI, Combinatorial and algorithmic analysis of stabbing and visibility problems in 3-dimensional space, PhD Thesis, Courant Institute of Mathematical Sciences, New York University, February 1991.
	P91b	M. PELLEGRINi, New results on ray-shooting and isotopy classes of lines in 3-dimensional space, manuscript, 1991.
	Sh	M. S~IAitm, On k-sets in arrangements of curves and surfaces, to appear in Discrete and Computational Geometry.

CITED BY 3

	Bernard Chazelle, Computational geometry: a retrospective, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.75-94, May 23-25, 1994, Montreal, Quebec, Canada
	Boris Aronov , Micha Sharir, Castles in the air revisited, Proceedings of the eighth annual symposium on Computational geometry, p.146-156, June 10-12, 1992, Berlin, Germany
	Dan Halperin , Micha Sharir, Almost tight upper bounds for the single cell and zone problems in three dimensions, Proceedings of the tenth annual symposium on Computational geometry, p.11-20, June 06-08, 1994, Stony Brook, New York, United States