Construction of epsilon nets

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Construction of epsilon nets

Full text

Pdf (763 KB)

Source

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

Saarbruchen, West Germany

Pages: 1 - 10

Year of Publication: 1989

ISBN:0-89791-318-3

Author

J. Matoušek

Dept. of Comp. Science, Charles University, Malostranské nám. 25, 118 00 Praha 1, Czechoslovakia

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): 1, Downloads (12 Months): 25, Citation Count: 4

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

	AKS	M. Ajtai , J. Komlós , E. Szemerédi, An 0(n log n) sorting network, Proceedings of the fifteenth annual ACM symposium on Theory of computing, p.1-9, December 1983 [doi>10.1145/800061.808726]
	Chv	V.Chv&tal: A greedy heuristics for the set-covering problem Math. of Oper. Res. JC1!?79> p. 233-233
	CSSS	R.Cole,J.Salowe,W.L.Steiger,E.Szemeredi: Optimal slope selection, October 1987, to appear
	E	Herbert Edelsbrunner, Algorithms in combinatorial geometry, Springer-Verlag New York, Inc., New York, NY, 1987
	EW	H.Edelsbrunner,E.Welzl: Constructing belts in 2-dimensional arrangements, SIAM J. on Computing 15Cl986), p. 271-284
	HW	D.Haussler,E.Welzl: e-nets and simplex range queries Discr.& Comp. C3eom. 2Cl987> p. 127-151
	L	L.Lov&z: On the ratio of optimal integral and fractional cover, Discr. Math. 13<1975> p. 383-390
	Ma	J.Matousek: Approximate halfplanar range counting RAM Series 39-87, Charles University, Prague 1987
	S	S.Suri: A polygon partitioning technique for link distance problems <manuscript>
	W	E. Welzl, Partition trees for triangle counting and other range searching problems, Proceedings of the fourth annual symposium on Computational geometry, p.23-33, June 06-08, 1988, Urbana-Champaign, Illinois, United States [doi>10.1145/73393.73397]

CITED BY 4

	János Pach , Gerhard Woeginger, Some new bounds for Epsilon-nets, Proceedings of the sixth annual symposium on Computational geometry, p.10-15, June 07-09, 1990, Berkley, California, United States
	Jiří Matoušek , Raimund Seidel , E. Welzl, How to net a lot with little: small &egr;-nets for disks and halfspaces, Proceedings of the sixth annual symposium on Computational geometry, p.16-22, June 07-09, 1990, Berkley, California, United States
	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
	Marco Pellegrini, On lines missing polyhedral sets in 3-space, Proceedings of the ninth annual symposium on Computational geometry, p.19-28, May 18-21, 1993, San Diego, California, United States