{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T20:19:12Z","timestamp":1770149952017,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1023\/a:1021231927255","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T00:56:49Z","timestamp":1048208209000},"page":"265-281","source":"Crossref","is-referenced-by-count":68,"title":["Enumerating Order Types for Small Point Sets with Applications"],"prefix":"10.1007","volume":"19","author":[{"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[]},{"given":"Franz","family":"Aurenhammer","sequence":"additional","affiliation":[]},{"given":"Hannes","family":"Krasser","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5100523_CR1","doi-asserted-by":"crossref","unstructured":"Aichholzer, O.: The path of a triangulation, in Proc. 15th Ann. ACM Sympos. Computational Geometry, Miami Beach, USA, 1999, pp. 14-23.","DOI":"10.1145\/304893.304896"},{"key":"5100523_CR2","doi-asserted-by":"crossref","unstructured":"Aichholzer, O., Aurenhammer, F. and Krasser, H.: Enumerating order types for small point sets with applications, In: Proc. 17th Ann. ACM Sympos. Computational Geometry, Medford, USA, 2001, pp. 11-18.","DOI":"10.1145\/378583.378596"},{"key":"5100523_CR3","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/3-540-44679-6_12","volume-title":"Proc. 7th Ann. Int. Computing and Combinatorics Conf. CoCOON-2001, Guilin, China","author":"O. Aichholzer","year":"2001","unstructured":"Aichholzer, O., Aurenhammer, F., Hurtado, F. and Krasser, H.: Towards compatible triangulations, In: Proc. 7th Ann. Int. Computing and Combinatorics Conf. CoCOON-2001, Guilin, China, Lecture Notes in Comput. Sci. 2108, Springer, New York, 2001, pp. 101\u2013110. To appear in Theoret. Comput. Sci."},{"key":"5100523_CR4","unstructured":"Aichholzer, O., Hurtado, F. and Noy, M.: On the number of triangulations every planar point set must have, In: Proc. 13th Ann. Canadian Conference on Computational Geometry CCCG 2001, Waterloo, Canada, 2001, pp. 13-16."},{"key":"5100523_CR5","unstructured":"Aichholzer, O. and Krasser, H.: The point set order type data base: A collection of applications and results, In: Proc. 13th Ann. Canadian Conference on Computational Geometry CCCG 2001, Waterloo, Canada, 2001, pp. 17-20."},{"key":"5100523_CR6","doi-asserted-by":"crossref","unstructured":"Arkin, E., Fekete, S., Hurtado, F., Mitchell, J., Noy, M., Sacrist\u00e1n, V. and Sethia, S.: On the reflexivity of point sets, In: Proc. 10th Ann. Fall Workshop on Computational Geometry, Stony Brook, NY, 2000.","DOI":"10.1007\/3-540-44634-6_18"},{"key":"5100523_CR7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0925-7721(93)90028-5","volume":"3","author":"B. Aronov","year":"1993","unstructured":"Aronov, B., Seidel, R. and Souvaine, D.: On compatible triangulations of simple polygons, Comput. Geom.\n3 (1993), 27\u201335.","journal-title":"Comput. Geom."},{"key":"5100523_CR8","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"Aurenhammer, F.: Voronoi diagrams-a survey of a fundamental geometric data structure, ACM Comput. Surveys\n23 (1991), 345\u2013405.","journal-title":"ACM Comput. Surveys"},{"key":"5100523_CR9","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01215345","volume":"14","author":"B. Aronov","year":"1994","unstructured":"Aronov, B., Erd\u00f6s, P., Goddard, W., Kleitman, D. J., Klugerman, M., Pach, J. and Schulman, L. J.: Crossing families, Combinatorica\n14 (1994), 127\u2013134.","journal-title":"Combinatorica"},{"key":"5100523_CR10","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D. Avis","year":"1996","unstructured":"Avis, D. and Fukuda, K.: Reverse search for enumeration, Discrete Appl. Math.\n65 (1996), 618\u2013632.","journal-title":"Discrete Appl. Math."},{"key":"5100523_CR11","unstructured":"Bj\u00f6rner, A., Las Vergnas, M., Sturmfels, B., White, N. and Ziegler, G.: Oriented Matroids, Cambridge Univ. Press, 1993."},{"key":"5100523_CR12","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s004540010027","volume":"24","author":"J. Bokowski","year":"2000","unstructured":"Bokowski, J. and Guedes de Oliveira, A.: On the generation of oriented matroids, Discrete Comput. Geom.\n24 (2000), 197\u2013208.","journal-title":"Discrete Comput. Geom."},{"key":"5100523_CR13","doi-asserted-by":"crossref","first-page":"23","DOI":"10.37236\/1567","volume":"8","author":"A. Brodsky","year":"2001","unstructured":"Brodsky, A., Durocher, S. and Gether, E.: The rectilinear crossing number of K\n10 is 62, Electron. J. Combinatorics\n8 (2001), Research Paper 23.","journal-title":"Electron. J. Combinatorics"},{"key":"5100523_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03427-9","volume-title":"Computational Geometry-Algorithms and Applications","author":"M. de Berg","year":"1997","unstructured":"de Berg, M., van Krefeld, M., Overmars, M. and Schwarzkopf, O.: Computational Geometry-Algorithms and Applications, Springer, Berlin, 1997."},{"key":"5100523_CR15","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/PL00009354","volume":"19","author":"T. K. Dey","year":"1998","unstructured":"Dey, T. K.: Improved bounds for planar k-sets and related problems, Discrete Comput. Geom.\n19 (1998), 373\u2013382.","journal-title":"Discrete Comput. Geom."},{"key":"5100523_CR16","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1080\/00029890.1973.11993230","volume":"88","author":"P. Erd\u00f6s","year":"1973","unstructured":"Erd\u00f6s, P. and Guy, R. K.: Crossing number problems, Amer. Math. Monthly\n88 (1973), 52\u201358.","journal-title":"Amer. Math. Monthly"},{"key":"5100523_CR17","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/PL00009318","volume":"18","author":"S. Felsner","year":"1997","unstructured":"Felsner, S.: On the number of arrangements of pseudolines, Discrete Comput. Geom.\n18 (1997), 257\u2013267.","journal-title":"Discrete Comput. Geom."},{"key":"5100523_CR18","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s00454-001-0056-5","volume":"27","author":"L. Finschi","year":"2002","unstructured":"Finschi, L. and Fukuda, K.: Generation of oriented matroids-a graph theoretical approach, Discrete Comput. Geom.\n27 (2002), 117\u2013136.","journal-title":"Discrete Comput. Geom."},{"key":"5100523_CR19","volume-title":"Simultaneous edge flipping in triangulations","author":"J. Galtier","year":"2000","unstructured":"Galtier, J., Hurtado, F., Noy, M., Perennes, S. and Urrutia, J.: Simultaneous edge flipping in triangulations, Manuscript, Universitat Politecnica de Catalunya, Barcelona, Spain, 2000. http:\/\/www-ma2.upc.es\/~hurtado\/flipcorner.html"},{"key":"5100523_CR20","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0925-7721(00)00010-9","volume":"16","author":"A. Garc\u00eda","year":"2000","unstructured":"Garc\u00eda, A., Noy, M. and Tejel, J.: Lower bounds on the number of crossing-free subgraphs of K\nN, Comput. Geom.\n16 (2000), 211\u2013221.","journal-title":"Comput. Geom."},{"key":"5100523_CR21","volume-title":"Handbook of Discrete and Computational Geometry","author":"J. E. Goodman","year":"1997","unstructured":"Goodman, J. E.: Pseudoline arrangements, In: J. E. Goodman and J. O'Rourke (eds), Handbook of Discrete and Computational Geometry, CRC Press LLC, Boca Raton, NY, 1997."},{"key":"5100523_CR22","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1137\/0212032","volume":"12","author":"J. E. Goodman","year":"1983","unstructured":"Goodman, J. E. and Pollack, R.: Multidimensional sorting, SIAM J. Comput.\n12 (1983), 484\u2013507.","journal-title":"SIAM J. Comput."},{"key":"5100523_CR23","doi-asserted-by":"crossref","unstructured":"Goodman, J. E., Pollack, R. and Sturmfels, B.: Coordinate representation of order types requires exponential storage, In: Proc. 21st Ann. ACM Sympos. Theory of Computing, 1989, pp. 405-410.","DOI":"10.1145\/73007.73046"},{"key":"5100523_CR24","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF02187887","volume":"2","author":"R. B. Hayward","year":"1987","unstructured":"Hayward, R. B.: A lower bound for the optimal crossing-free Hamiltonian cycle problem, Discrete Comput. Geom.\n2 (1987), 327\u2013343.","journal-title":"Discrete Comput. Geom."},{"key":"5100523_CR25","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1142\/S0218195999000121","volume":"9","author":"E. Kranakis","year":"1999","unstructured":"Kranakis, E. and Urrutia, J.: Isomorphic triangulations with small number of Steiner points, Intertat. J. Comput. Geom. Appl.\n9 (1999), 171\u2013180.","journal-title":"Intertat. J. Comput. Geom. Appl."},{"key":"5100523_CR26","volume-title":"Kompatible Triangulierungen ebener Punktmengen","author":"H. Krasser","year":"1999","unstructured":"Krasser, H.: Kompatible Triangulierungen ebener Punktmengen, MS thesis, IGI-TU Graz, Austria, 1999."},{"key":"5100523_CR27","doi-asserted-by":"crossref","unstructured":"Saalfeld, A.: Joint triangulations and triangulation maps, In: Proc. 3rd Ann. ACM Sympos. Computational Geometry, Waterloo, Canada, 1987, pp. 195-204.","DOI":"10.1145\/41958.41979"},{"key":"5100523_CR28","unstructured":"Santos, F. and Seidel, R.: A better bound on the number of triangulations of a planar point set, Manuscript, 2000."},{"key":"5100523_CR29","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/PL00009363","volume":"19","author":"G. T\u00f3th","year":"1998","unstructured":"T\u00f3th, G. and Valtr, P.: Note on Erd\u00f6s-Szekeres theorem, Discrete Comput. Geom.\n19 (1998), 457\u2013459.","journal-title":"Discrete Comput. Geom."}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021231927255.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021231927255\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021231927255.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T08:56:14Z","timestamp":1751878574000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021231927255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["5100523"],"URL":"https:\/\/doi.org\/10.1023\/a:1021231927255","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}