Polytopes in arrangements

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Polytopes in arrangements

Full text

Pdf (915 KB)

Source

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

Miami Beach, Florida, United States

Pages: 154 - 162

Year of Publication: 1999

ISBN:1-58113-068-6

Authors

Boris Aronov	Dept. of CIS, Polytechnic University, Brooklyn, NY
Tamal K. Dey	Dept. of CSE, I.I.T. Kharagpur, Kharagpur 721302, India

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): 6, Citation Count: 0

Additional Information:

references 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/304893.304963 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.

	AA92	Pankaj K. Agarwal , Boris Aronov, Counting facets and incidences, Discrete & Computational Geometry, v.7 n.4, p.359-369, 1992 [doi>10.1007/BF02187848]
	AMS94	Boris Aronov , Jiří Matoušek , Micha Sharir, On the sum of squares of cell complexities in hyperplane arrangements, Journal of Combinatorial Theory Series A, v.65 n.2, p.311-321, Feb. 1994 [doi>10.1016/0097-3165(94)90027-2]
	CEG+90	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]
	Cha84	Bernard Chazelle, Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm, SIAM Journal on Computing, v.13 n.3, p.488-507, August 1984 [doi>10.1137/0213031]
	DE94	T. K. Dey and H. Ecielsbrunner. Counting triangle crossings and halving planes. Discrete Comput. Geom., 12:281-289, 1994.
	Dey98	T.K. Dey. Improved bounds on planar k-sets and related problems. Discrete Comput. Geom., 19:373-382, 1998.
	DS94	Tamal K. Dey , Nimish R. Shah, Many-face complexity in incremental convex arrangements, Information Processing Letters, v.51 n.5, p.227-231, Sept. 12, 1994 [doi>10.1016/0020-0190(94)00098-0]
	Ede87	Herbert Edelsbrunner, Algorithms in combinatorial geometry, Springer-Verlag New York, Inc., New York, NY, 1987
	EGS88	H. Edelsbrunner, Leonidas J. Guibas, and Micha Sharir. The complexity of many cells in arrangements of planes and related problems. In Proc. Int. Conf. Mathematical Prog., page 147, 1988.
	Epp95	D. Eppstein. Geometric lower bounds for parametric matroid optimization. Disc. Comput. Geom., 20:662-671, 1998.
	Ha197	Dan Halperin, Arrangements, Handbook of discrete and computational geometry, CRC Press, Inc., Boca Raton, FL, 1997
	HS91	D. Halperin and Micha Sharir. On disjoint concave chains in arrangements of (pseudo) lines. Inform. Process. Left., 40(4): 189-192, 1991.
	HS92	Dan Halperin , Micha Sharir, Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom, Computational Geometry: Theory and Applications, v.1 n.5, p.269-303, May 1992 [doi>10.1016/0925-7721(92)90008-G]
	HS94	Dan Halperin , Micha Sharir, On disjoint concave chains in arrangements of (pseudo) lines, Information Processing Letters, v.51 n.1, p.53-56, July 12, 1994 [doi>10.1016/0020-0190(94)00057-3]
	HS95	Dan Halperin , Micha Sharir, Arrangements and their applications in robotics: recent developments, Proceedings of the workshop on Algorithmic foundations of robotics, p.495-511, May 1995, San Francisco, California, United States
	HS98	J. E. Hershberger , J. S. Snoeyink, Erased arrangements of lines and convex decompositions of polyhedra, Computational Geometry: Theory and Applications, v.9 n.3, p.129-143, Feb. 1998 [doi>10.1016/S0925-7721(97)00024-2]
	KW98	Gyula K#rolyi and Emo Welzl. Crossing-free segments and triangles in point configurations. Manuscript, 1998.
	KT99	Naoki Katoh and Takeshi Tokuyama. A constructive proof of Lov~sz's lemma for the three dimensional k-level of concave surfaces. Manuscript, 1999.
	McM70	P. McMullen. The maximal number of faces of a convex polytope. Mathematika, 17:179-184, 1970.
	Szé97	László A. Székely, Crossing Numbers and Hard Erdös Problems in Discrete Geometry, Combinatorics, Probability and Computing, v.6 n.3, p.353-358, September 1997 [doi>10.1017/S0963548397002976]