On the number of arrangements of pseudolines

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On the number of arrangements of pseudolines

Full text

Pdf (604 KB)

Source

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

Philadelphia, Pennsylvania, United States

Pages: 30 - 37

Year of Publication: 1996

ISBN:0-89791-804-5

Author

Stefan Felsner

Freie Universität Berlin, Fachbereich Mathematik und Informatik, Takustr. 9, 14195 Berlin, Germany

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

Additional Information:

references 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/237218.237232 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	M. Bern, D. Eppstein, P. Plassman, and F. Yao. Horizon theorems for lines and polygons. In J. Goodman, R. Pollack, and W. Steiger, editors, Discrete and Computational Geometry, pages 45-66. Amer. Math. Soc., 1991.
	2	A. BjSrner, M. Las Vergnas, B. Sturmfels, N. White, and G. Ziegler. Oriented Matroids. Cambridge University Press, Cambridge, 1993.
	3	P. Edelman and C. Greene. Balanced tableaux. Advances in Math., 63:42-99, 1987.
	4	Herbert Edelsbrunner , Leonidas Guibas, Topologically sweeping an arrangement, Journal of Computer and System Sciences, v.38 n.1, p.165-194, February 1989 [doi>10.1016/0022-0000(89)90038-X]
	5	J. E. Goodman. Proof of a conjecture of Burr, Grfinbaum and Sloane. Discrete Math., 32:27-35, 1980.
	6	J. E. Goodman and R. Pollack. Semispaces of configurations, cell complexes of arrangements. J. Combin. Theory Set. A, 37:257-293, 1984.
	7	J. E. Goodman and R. Pollack. Allowable sequences and order types in discrete and computational geometry. In J. Pach, editor, New Trends in Discrete and Computational Geometry, volume 10 of Algorithms and Combinatorics, pages 103-134. Springer-Verlag, 1993.
	8	B. Grfinbaum. Arrangements and spreads. Regional Conf. Ser. Math., Amer. Math. Soc., number 10, Providence, RI, 1972.
	9	Donald E. Knuth. Axioms and Hulls, volume 606 of Lecture Notes in Computer Science. Springer-Verlag, Heidelberg, Germany, 1992.
	10	R. Stanley. On the number of reduced decompositions of elements of Coxeter groups. Europ. J. Combinatorics, 5:359- 372, 1984.
	11	Emo Welzl, More on k-sets of finite sets in the plane, Discrete & Computational Geometry, v.1 n.1, p.95-100, 1986 [doi>10.1007/BF02187686]