ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Crossing families
Full text PdfPdf (471 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: 351 - 356  
Year of Publication: 1991
ISBN:0-89791-426-0
Authors
Boris Aronov  Department of Computer Science, Polytechnic University
Paul Erdős  Mathematical Institute of the Hungarian Academy of Sciences
Wayne Goddard  Department of Mathematics, Massachusetts Institute of Technology
Daniel J. Kleitman  Department of Mathematics, Massachusetts Institute of Technology
Michael Klugerman  Department of Mathematics, Massachusetts Institute of Technology
János Pach  Mathematical Institute of the Hungarian Academy of Sciences and Courant Institute, New York University
Leonard J. Schulman  Department of Mathematics, Massachusetts Institute of Technology
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): 3,   Downloads (12 Months): 13,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/109648.109687
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
N. Alon and P. Erd6s, Disjoint edges in geometric graphs, Discrete Comput. Geom. 4 (1989), 287-290.
 
2
V. Capoyleas and J. Pach, A Tur~in-type theorem on chords of a convex polygon, DIMACS Technical Report 90-30, 1990, to appear in J. Combin. Theory Set. A.
 
3
Herbert Edelsbrunner, Algorithms in combinatorial geometry, Springer-Verlag New York, Inc., New York, NY, 1987
 
4
P. Erd6s and G. Szekeres, A combinatorial problem in geometry, Compositio Math. 2 (1935), 463-470.
5
Jiří Matoušek, Efficient partition trees, Proceedings of the seventh annual symposium on Computational geometry, p.1-9, June 10-12, 1991, North Conway, New Hampshire, United States  [doi>10.1145/109648.109649]
 
6
E.G. Rees, Notes on Geometry, Springer-Verlag, Berlin, 1983.

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Geometrical problems and computations

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Computations on discrete structures


General Terms:
Algorithms

Collaborative Colleagues:
Boris Aronov: colleagues
Paul Erdős: colleagues
Wayne Goddard: colleagues
Daniel J. Kleitman: colleagues
Michael Klugerman: colleagues
János Pach: colleagues
Leonard J. Schulman: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player