Skip to main content
SpringerLink
Log in

Allowable Sequences and Order Types in Discrete and Computational Geometry

  • Chapter
New Trends in Discrete and Computational Geometry

Part of the book series: Algorithms and Combinatorics ((AC,volume 10))

Abstract

The allowable sequence associated to a configuration of points was first developed by the authors in order to investigate what combinatorial structure lay behind the Erdős-Szekeres conjecture (that any 2n-2 + 1 points in general position in the plane contain among them n points which are in convex position). Though allowable sequences did not lead to any progress on this ancient problem, there did emerge an object that had considerable intrinsic interest, that turned out to be related to some other well-studied structures such as pseudoline arrangements and oriented matroids, and that had as well a combinatorial simplicity and suggestiveness which turned out to be effective in the solution of several other classical problems. These connections and applications are discussed in Sections 2, 3, and 4 of this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Alon: The number of polytopes, configurations, and real matroids. Mathematika 33 (1986) 62–71

    Article  MathSciNet  MATH  Google Scholar 

  2. N. Alon and E. Györi: The number of small semispaces of a finite set of points in the plane. J. Comb. Theory, Ser. A 41 (1986) 154–157

    Article  MATH  Google Scholar 

  3. B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir and R. Wenger: Points and triangles in the plane and halving planes in space. Discrete Comput. Geom. 6 (1991) 435–442

    MathSciNet  MATH  Google Scholar 

  4. B. Aronov, J. E. Goodman, R. Pollack and R. Wenger: Hadwiger’s theorem for line transversals does not generalize to higher dimensions. Unpublished manuscript, 1989

    Google Scholar 

  5. I. Bárány, Z. Füredi and L. Lovász: On the number of halving planes. In: Proc. Fifth Annual ACM Sympos. on Computational Geometry. 1989, pp. 140–144

    Google Scholar 

  6. A. Björner, M. Las Vergnas, B. Sturmfels, N. White and G. Ziegler: Oriented Matroids. Cambridge Univ. Press, Cambridge 1992

    Google Scholar 

  7. R. G. Bland and M. Las Vergnas: Orientability of Matroids. J. Comb. Theory, Ser. B 23 (1978) 94–123

    Article  Google Scholar 

  8. J. Bokowski, J. Richter and B. Sturmfels: Nonrealizability proofs in computational geometry. Discrete Comput. Geom. 5 (1990) 333–350

    MathSciNet  MATH  Google Scholar 

  9. J. Bokowski and B. Sturmfels: Oriented matroids and chirotopes—problems of geometric realizability. TH Darmstadt, 1985

    Google Scholar 

  10. J. Bokowski and B. Sturmfels: On the coordinatization of oriented matroids. Discrete Comput. Geom. 1 (1986) 293–306

    MathSciNet  MATH  Google Scholar 

  11. J. Bokowski and B. Sturmfels: Computational Synthetic Geometry. Lecture Notes in Mathematics, vol. 1355. Springer, Berlin Heidelberg 1989

    Google Scholar 

  12. E. Boros and Z. Fiiredi: The number of triangles covering the center of an n-set. Geometriae Dedicata 17 (1984) 69–77

    Article  MathSciNet  MATH  Google Scholar 

  13. G. R. Burton and G. B. Purdy: The directions determined by n points in the plane. J. London Math. Soc. (2) 20 (1979) 109–114

    Article  MathSciNet  MATH  Google Scholar 

  14. R. J. Canham: Arrangements of hyperplanes in projective and Euclidean spaces. University of East Anglia, Norwich 1971

    Google Scholar 

  15. S. E. Cappell, J. E. Goodman, J. Pach, R. Pollack, M. Sharir and R. Wenger: The Combinatorial Complexity of Hyperplane Transversals. Adv. Math., to appear

    Google Scholar 

  16. V. Chvátal and G. Klincsek: Finding largest convex subsets. Cong. Num. 29 (1980) 453–460

    Google Scholar 

  17. K. L. Clarkson and P. W. Shor: Applications of random sampling, II. Discrete Comput. Geom. 4 (1989) 387–421

    MathSciNet  MATH  Google Scholar 

  18. R. Cordovil: Sur les matroïdes orientés de rang trois et les arrangements de pseudodroites dans le plan projectif reél. European J. Comb. 3 (1982) 307–318

    MathSciNet  MATH  Google Scholar 

  19. R. Cordovil: Oriented matroids and geometric sorting. Canad. Math. Bull. 26 (1983) 351–354

    MathSciNet  MATH  Google Scholar 

  20. L. Danzer, B. Griinbaum and V. Klee: Helly’s Theorem and its Relatives. In: Convexity. Proc. Sympos. Pure Math., Vol. 7, (1963) pp. 100–181. Amer. Math. Soc., Providence

    Google Scholar 

  21. D. Dobkin and D. Silver: Recipes for geometry and numerical analysis, Part 1: an empirical study. In: Proc. Fourth Annual ACM Sympos. on Computational Geometry, 1988, pp. 93–105

    Google Scholar 

  22. A. Dreiding, A. Dress and A. Haegi: Classification of Mobile Molecules by Category Theory. Studies in Physical and Theoretical Chemistry 23 (1982) 39–58

    Google Scholar 

  23. A. Dreiding and K. Wirth: Classification of Finite Ordered Point Sets in Oriented d-Dimensional Space. Math. Chemistry 8 (1980) 341–352

    MathSciNet  MATH  Google Scholar 

  24. A. Dress: Chirotopes and Oriented Matroids. Bayr. Math. Schriften 21 (1986) 14–68

    MathSciNet  Google Scholar 

  25. P. Edelman: On the average number of k-sets. Discrete Comput. Geom. 8 (1992) 209–213

    Article  MathSciNet  MATH  Google Scholar 

  26. P. Edelman and C. Greene: Combinatorial correspondences for Young tableaux, balanced tableaux and maximal chains in the Bruhat order of In: Combinatorics and Contemporary Math., vol. 34. Amer. Math. Soc., Providence 1984, pp. 42–99

    Google Scholar 

  27. H. Edelsbrunner: Algorithms in Combinatorial Geometry. Springer, Berlin 1987

    MATH  Google Scholar 

  28. H. Edelsbrunner, J. O’Rourke and R. Seidel: Constructing arrangements of lines and hyperplanes with applications. SIAM J. Comput 15 (1986) 341–363

    MathSciNet  MATH  Google Scholar 

  29. H. Edelsbrunner and E. Welzl: On the number of line-separations of a finite set in the plane. J. Comb. Theory, Ser. A 38 (1985) 15–29

    Article  MathSciNet  MATH  Google Scholar 

  30. P. Erdös, L. Lovász, A. Simmons and E. G. Strauss: Dissection graphs of planar point sets. In: A Survey of Combinatorial Theory. North-Holland, Amsterdam 1973, pp. 139–149

    Google Scholar 

  31. J. Folkman and J. Lawrence: Oriented Matroids. J. Combin. Theory, Ser. B 25 (1978) 199–236

    Article  MathSciNet  MATH  Google Scholar 

  32. S. Fortune: Stable maintenance of point-set triangulation in two dimensions. In: Proc. 30th Annual IEEE Sympos. on the Foundations of Computer Science, 1989, pp. 494–499

    Google Scholar 

  33. S. Fortune and V. Milenkovic: Numerical stability of algorithms for line arrangements. In: Proc. Seventh Annual ACM Sympos. on Computational Geometry, 1991, pp. 334–341

    Google Scholar 

  34. M. R. Garey and D. S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York 1979

    MATH  Google Scholar 

  35. J. E. Goodman: Proof of a conjecture of Burr, Grünbaum, and Sloane. Discrete Math. 32 (1980) 27–35

    Article  MathSciNet  MATH  Google Scholar 

  36. J. E. Goodman and R. Pollack: On the combinatorial classification of non-degenerate configurations in the plane. J. Comb. Theory, Ser. A 29 (1980) 220–235

    Article  MathSciNet  MATH  Google Scholar 

  37. J. E. Goodman and R. Pollack: Proof of Grünbaum’s conjecture on the stretchability of certain arrangements of pseudolines. J. Comb. Theory, Ser. A 29 (1980) 385–390

    Article  MathSciNet  MATH  Google Scholar 

  38. J. E. Goodman and R. Pollack: Convexity theorems for generalized planar configurations. In: Proc. of the Conf. on Convexity and Related Combinatorial Geometry, Univ. of Okla., 1980. Marcel Dekker, New York 1982, pp. 73–80

    Google Scholar 

  39. J. E. Goodman and R. Pollack: Helly-type theorems for pseudoline arrangements in P 2. J. Comb. Theory, Ser. A 32 (1982) 1–19

    Article  MathSciNet  MATH  Google Scholar 

  40. J. E. Goodman and R. Pollack: A theorem of ordered duality. Geometriae Dedicata 12 (1982) 63–72

    Article  MathSciNet  MATH  Google Scholar 

  41. J. E. Goodman and R. Pollack: Multidimensional Sorting. SIAM J. Comput. 12 (1983) 484–507

    MathSciNet  MATH  Google Scholar 

  42. J. E. Goodman and R. Pollack: Isotopy problem for configurations. In: List of Problems, Tagungsbericht Oberwolfach. Tagung fiber kombinatorische Geometrie. September 1984

    Google Scholar 

  43. J. E. Goodman and R. Pollack: On the number of k-subsets of a set of n points in the plane. J. Comb. Theory, Ser. A 36 (1984) 101–104

    Article  MathSciNet  MATH  Google Scholar 

  44. J. E. Goodman and R. Pollack: Polynomial realization of pseudoline arrangements. Comm. Pure Appl. Math. 38 (1984) 725–732

    Article  MathSciNet  Google Scholar 

  45. J. E. Goodman and R. Pollack: Semispaces of configurations, cell complexes of arrangements. J. Comb. Theory, Ser. A 37 (1984) 257–293

    Article  MathSciNet  Google Scholar 

  46. J. E. Goodman and R. Pollack: A combinatorial version of the isotopy conjecture. In: Discrete Geometry and Convexity. Ann. New York Acad. Sci., 1985, pp. 12–19

    Google Scholar 

  47. J. E. Goodman and R. Pollack: Upper bounds for configurations and polytopes in Rd. Discrete Comput. Geom. 1 (1986) 219–227

    MathSciNet  MATH  Google Scholar 

  48. J. E. Goodman and R. Pollack: Hadwiger’s Transversal Theorem in Higher Dimensions. J. Amer. Math. Soc. 1 (1988) 301–309

    MathSciNet  MATH  Google Scholar 

  49. J. E. Goodman, R. Pollack and B. Sturmfels: Coordinate representation of order types requires exponential storage. In: Proc. 21st Annual ACM Sympos. on the Theory of Computing 1989, pp. 405–410

    Google Scholar 

  50. J. E. Goodman, R. Pollack and B. Sturmfels: The Intrinsic Spread of a Configuration in Rd. J. Amer. Math. Soc. 3 (1990) 639–651

    MathSciNet  MATH  Google Scholar 

  51. J. E. Goodman, R. Pollack and R. Wenger: Geometric Transversal Theory. In: Recent Advances in Discrete and Computational Geometry. Springer, Berlin Heidelberg 1991. This volume, pp. 163–198

    Google Scholar 

  52. D. H. Greene and F. F. Yao: Finite-resolution computational geometry. In: Proc. 27th Annual IEEE Sympos. on the Foundations of Computer Science 1986, pp. 143–152

    Google Scholar 

  53. D. Yu. Grigor’ev and N. N. Vorobjov: Solving systems of polynomial inequalities in subexponential time. J. Symbolic Corn. 5 (1988) 37–64

    Article  MathSciNet  MATH  Google Scholar 

  54. B. Grünbaum: Arrangements and Spreads. Amer. Math. Soc., Providence 1972

    Google Scholar 

  55. L. Guibas, D. Salesin and J. Stolfi: Epsilon geometry: building robust algorithms from imprecise computations. In: Proc. Fifth Annual ACM Sympos. on Computational Geometry, 1989, pp. 208–217

    Google Scholar 

  56. H. Hadwiger: Uber Eibereiche mit gemeinsamer Treffgeraden. Portugal. Math. 16 (1957) 23–29

    MathSciNet  MATH  Google Scholar 

  57. E. Halsey: Zonotopal complexes on the d-cube. University of Washington, Seattle 1971

    Google Scholar 

  58. E. Helly: Uber Mengen Konvexer Körper mit Gemeinschaftlichen Punkten. Jber. Deutsch. Math. Verein 32 (1923) 175–176

    MATH  Google Scholar 

  59. C. Hoffman: The problems of accuracy and robustness in geometric computation. Computer 22 (1989) 31–42

    Article  Google Scholar 

  60. J. Hoperoft and P. Kahn: A paradigm for robust geometric algorithms. Technical Report TR 89–1044, Cornell University 1989

    Google Scholar 

  61. M. Iri and K. Sugihara: Geometric algorithms in finite precision arithmetic. Technical Report RMI 88–10, University of Tokyo 1988

    Google Scholar 

  62. M. Iri and K. Sugihara: Construction of the Voronoi diagram for one million generators in single precision arithmetic. First Canadian Conference on Computational Geometry, 1989

    Google Scholar 

  63. B. Jaggi, P. Mani-Levitska, N. White and B. Sturmfels: Uniform oriented matroids without the isotopy property. Discrete Comput. Geom. 4 (1989) 97100

    MathSciNet  Google Scholar 

  64. R. E. Jamison: Structure of slope critical configurations. Geometriae Dedicata 16 (1984) 249–277

    MathSciNet  MATH  Google Scholar 

  65. R. E. Jamison: A survey of the slope problem. In: Discrete Geometry and Convexity. Ann. New York Acad. Sci., 1985, pp. 34–51

    Google Scholar 

  66. R. E. Jamison and D. Hill: A catalogue of sporadic slope-critical configurations. Cong. Num. 40 (1983) 101–125

    MathSciNet  Google Scholar 

  67. G. Kalai: Many triangulated spheres. Discrete Comput. Geom. 3 (1988) 1–14

    MathSciNet  MATH  Google Scholar 

  68. M. Katchalski: Thin Sets and Common Transversals. J. Geom. 14 (1980) 103–107

    Article  MathSciNet  MATH  Google Scholar 

  69. P. Kirchberger: Über Tschebyschefsche Annáherungsmethoden. Math. Ann. 57 (1903) 509–540

    Article  MathSciNet  MATH  Google Scholar 

  70. M. Klawe, M. Paterson and N. Pippenger: Inversions with \( n^{1 + \Omega (1 + \sqrt {\log n)} } \) transpositions at the median. Unpublished manuscript, 1982

    Google Scholar 

  71. V. Klee: The number of vertices of a convex polytope. Canad. J. Math. 16 (1964) 701–720

    MathSciNet  MATH  Google Scholar 

  72. M. Las Vergnas: Order properties of lines in the plane and a conjecture of G. Ringel. J. Comb. Theory, Ser. B 41 (1986) 246–249

    Article  MATH  Google Scholar 

  73. F. Levi: Die Teilung der projectiven Ebene durch Gerade oder Pseusogerade. Ber. Math. -Phys. Kl. sáchs. Akad. Wiss. Leipzig 78 (1926) 256–267

    Google Scholar 

  74. L. Lovász: On the number of halving lines. Ann. Univ. Sci. Budapest, Eötvös, Sect. Math. 14 (1971) 107–108

    Google Scholar 

  75. P. McMullen: The maximum number of faces of a convex polytope. Mathematika 17 (1970) 179–184

    Article  MathSciNet  MATH  Google Scholar 

  76. V. Milenkovic: Verifiable implementations of geometric algorithms using finite precision arithmetic. Artificial Intelligence 37 (1988) 377–401

    Article  MATH  Google Scholar 

  77. V. Milenkovic: Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic. In: Proc. 30th Ann. IEEE Sympos. on the Foundations of Computer Science, 1989

    Google Scholar 

  78. V. Milenkovic and L. R. Nackman: Finding compact coordinate representations for polygons and polyhedra. In: Proc. Sixth Annual ACM Sympos. on Computational Geometry 1990, pp. 244–259

    Google Scholar 

  79. J. Milnor: On the Betti numbers of real varieties. Proc. Amer. Math. Soc. 15 (1964) 275–280

    Article  MathSciNet  MATH  Google Scholar 

  80. N. E. Mnëv: On manifolds of combinatorial types of projective configurations and convex polyhedra. Soviet Math. Dokl. 32 (1985) 335–337

    MATH  Google Scholar 

  81. N. E. Mnëv: The universality theorems on the classification problem of configuration varieties and convex polytope varieties. In: Topology and Geometry-Rokhlin Seminar, Lecture Notes in Mathematics, vol. 1346. Springer, Berlin Heidelberg, 1988, pp. 527–543

    Google Scholar 

  82. D. J. Newman: Efficient co-monotone approximation. J. Approx. Theory 25 (1979) 189–192

    Article  MathSciNet  MATH  Google Scholar 

  83. J. Pach, W. Steiger and E. Szemerédi: An upper bound on the number of planar k-sets. In: Proc. 30th Ann. IEEE Sympos. on the Foundations of Computer Science 1989, pp. 72–79

    Google Scholar 

  84. G. W. Peck: On k-sets in the plane. Discrete Math. 56 (1985) 73–74

    Article  MathSciNet  MATH  Google Scholar 

  85. R. Perrin: Sur le probléme des aspects. Bull. Soc. Math. France 10 (1881) 103–127

    MathSciNet  Google Scholar 

  86. R. Pollack and R. Wenger: A family of generalizations of Hadwiger’s theorem to hyperplane transversals. Unpublished manuscript

    Google Scholar 

  87. R. Pollack and R. Wenger: Necessary and sufficient conditions for hyperplane transversals. Combinatorica 10 (1990) 307–311

    Article  MathSciNet  MATH  Google Scholar 

  88. G. Ringel: Teilungen der projectiven Ebene durch Geraden oder topologische Geraden. Math. Z. 64 (1956) 79–102

    Article  MathSciNet  MATH  Google Scholar 

  89. S. Sahni: Quadratic Programming is NP-hard. SIAM J. Computing 3 (1974) 262–279

    Article  MathSciNet  Google Scholar 

  90. P. R. Scott: On the sets of directions determined by n points. Amer. Math. Monthly 77 (1970) 502–505

    Article  MathSciNet  MATH  Google Scholar 

  91. M. Sharir: On k-sets in arrangements of curves and surfaces. Discrete Comput. Geom. 6 (1991) 593–613

    MathSciNet  MATH  Google Scholar 

  92. P. W. Shor: Stretchability of pseudoline arrangements is NP-hard. In: Applied Geometry and Discrete Mathematics—The Victor Klee Festschrift, American Math. Soc., Providence 1991, pp. 531–554

    Google Scholar 

  93. R. Stanley: On the number of reduced decompositions of elements of Coxeter groups. Europ. J. Combinatorics 5 (1984) 359–372

    MathSciNet  MATH  Google Scholar 

  94. J. Steiner: Einige Gesetze fiber die Teilung der Ebene und des Raumes. J. Reine Angew. Math. 1 (1826) 349–364

    Article  MATH  Google Scholar 

  95. B. Sturmfels: Computational Synthetic Geometry. Ph. D. dissertation, University of Washington, Seattle 1987

    Google Scholar 

  96. P. Suvorov: Isotopic but not rigidly isotopic plane systems of straight lines. In: Topology and Geometry—Rokhlin Seminar, Lecture Notes in Mathematics, 1346. Springer, Berlin Heidelberg 1988, pp. 545–555

    Google Scholar 

  97. R. Thom: Sur l’homologie des variétés algébriques réelles. In: Differential and Combinatorial Topology, Princeton University Press, Princeton 1965, pp. 255–265

    Google Scholar 

  98. P. Ungar: 2N noncollinear points determine at least 2N directions. J. Comb. Theory, Ser. A 33 (1982) 343–347

    Article  MathSciNet  MATH  Google Scholar 

  99. S. T. Vrećica and R. T. Živaljevié: The colored Tverberg’s problem and complexes of injective functions, to appear

    Google Scholar 

  100. H. E. Warren: Lower bounds for approximation of nonlinear manifolds. Trans. Amer. Math. Soc. 133 (1968) 167–178

    Article  MathSciNet  MATH  Google Scholar 

  101. E. Welzl: More on k-sets of finite sets in the plane. Discrete Comput. Geom. 1 (1986) 95–100

    Article  MathSciNet  MATH  Google Scholar 

  102. R. Wenger: A Generalization of Hadwiger’s Theorem to Intersecting Sets. Discrete Comput. Geom. 5 (1990) 383–388

    Article  MathSciNet  MATH  Google Scholar 

  103. R. Wenger: Geometric Permutations and Connected Components. Technical report TR-90–50, DIMACS 1990

    Google Scholar 

  104. N. White: A nonuniform matroid which violates the isotopy conjecture. Discrete Comput. Geom. 4 (1989) 1–2

    MATH  Google Scholar 

  105. T. Zaslaysky: Facing Up to Arrangements: Face Count Formulas for Partitions of Space by Hyperplanes. Memoirs Amer. Math. Soc. (1), 154 Amer. Math. Soc., Providence 1975

    Google Scholar 

  106. T. Zaslaysky: Bilateral Geometries. Unpublished manuscript, 1980

    Google Scholar 

Download references

Authors
  1. Jacob E. Goodman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard Pollack
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematical Institute of the Hungarian Academy of Sciences, H-1364, Budapest, PF-127, Hungary

    János Pach

  2. Courant Institute, New York University, 251 Mercer Street, New York, NY, 10012, USA

    János Pach

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Goodman, J.E., Pollack, R. (1993). Allowable Sequences and Order Types in Discrete and Computational Geometry. In: Pach, J. (eds) New Trends in Discrete and Computational Geometry. Algorithms and Combinatorics, vol 10. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58043-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-58043-7_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55713-5

  • Online ISBN: 978-3-642-58043-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation