Abstract order type extension and new results on the rectilinear crossing number

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 91-98

  Aichholzer, Oswin ^a   Krasser, Hannes ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Complete graph; Order type; Pseudoline arrangement; Rectilinear crossing number

Indexed keywords

ASYMPTOTIC STABILITY; DATABASE SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY;

COMPLETE GRAPH; ORDER TYPE; PSEUDOLINE ARRANGEMENT; RECTILINEAR CROSSING NUMBER;

DATA ACQUISITION;

EID: 33244491912     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064108     Document Type: Conference Paper

References (29)

1. O.Aichholzer, Rectilinear Crossing Number Page. http://www.ist.tugraz.at/ staff/aichholzer/crossinga.html
2. O.Aichholzer, F.Aurenhammer, H.Krasser, Enumerating order types for small point sets with applications. Order, 19:265-281, 2002.
3. th ACM Symposium on Computational Geometry (SoCG), Barcelona, Spain, pages 19-24, 2002.
4. st European Workshop on Computational Geometry (EWCG), Eindhoven, The Netherlands, pages 89-92, 2005.
5. O.Aichholzer, F.Hurtado, and M.Noy, A lower bound on the number of triangulations of planar point sets. Computational Geometry: Theory and Applications, 29(2):135-145, 2004.
6. th Canadian Conference on Computational Geometry (CCCG), Waterloo, Ontario, Canada, pages 17-21, 2001.
7. D.Avis, K.Fukuda, Reverse search for enumeration, Discrete Applied Mathematics 65, pages 618-632, 1996.
8. n. Manuscript, submitted.
9. J.Bokowski, J.Richter, On the finding of final polynomials. European J. Combinatorics 11, pages 21-34, 1990.
10. B.Breitenlechner, Abstract order type extension for combinatorial problems. M.S.Thesis, Institute for Softwaretechnology, Graz University of Technology, Austria, 2004.
11. P.Erdös, R.K.Guy, Crossing number problems. Amer. Math. Monthly 88 (1973), 52-58.
12. P.Erdös, G.Szekeres, A combinatorial problem in geometry. Compositio Mathematioa, (2):463-470, 1935.
13. S.Felsner, On the number of arrangements of pseudolines. Discrete & Computational Geometry 18, pages 257-267, 1997.
14. L.Finschi, K.Fukuda, Generation of Oriented Matroids - A Graph Theoretical Approach. Discrete & Computational Geometry 27(1), pages 117-136, 2002.
15. J.B.Goodman, R.Pollack, Multidimensional sorting, SIAM J. Computing 12, pages 484-507, 1983.
16. J.E.Goodman, R.Pollack, New Trends in Discrete and Computational Geometry, Chapter V. J.Pach (Ed.), Springer Verlag, 1993.
17. J.E.Goodman, R.Pollack, B.Sturmfels, Coordinate representation of order types requires exponential storage. 21" ACM Symposium on Theory of Computing (STOC), pages 405-410, 1989.
18. B.Grünbaum, Convex Polytopes. Interscience Publ., London, 1967.
19. R.K.Guy, A combinatorial problem. Nabla (Bulletin of the Malayan Mathematical Society), 7, 68-72, 1967.
20. F.Harary, A.Hill, On the number of crossings in a complete graph. Proc, Edinburgh Math, Society (2) 13 (1962), 333-338.
21. H.F.Jensen, personal communication, 2004.
22. H.Krasser, Order types of point sets in the plane. PhD thesis, Institute for Theoretical Computer Science, Graz University of Technology, Austria, 2003.
23. L.Lovász, K.Vesztergombi, U.Wagner, E.Welzl, Convex Quadrilaterals and k-sets. Towards a Theory of Geometric Graphs (J.Pach, Ed,), AMS Contemporary Mathematics 342 (2004), 139-148.
24. N.E.Mnëv, On manifolds of combinatorial types of protective configurations and convex polyhedra. Soviet Math. Dokl., 32, pages 335-337, 1985.
25. J.Pach, G.Tóth, Thirteen problems on crossing numbers. Geombinatorics 9 (2000), 195-207.
26. J.Richter-Gebert, Two interesting oriented matroids. Documenta Mathematics 1, pages 137-148, 1996.
27. R.Seidel, personal communication, 2005.
28. N.J.A.Sloane, The On-line Encyclopedia of Integer Sequences, http://www.research.att.com/~njas/sequences/
29. W.T.Tutte, Toward a theory of crossing numbers. J. Combinatorial Theory 8 (1970), 45-53.