{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T07:38:30Z","timestamp":1777448310122,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T00:00:00Z","timestamp":1322611200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s00454-011-9388-y","type":"journal-article","created":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T19:58:45Z","timestamp":1322683125000},"page":"17-43","source":"Crossref","is-referenced-by-count":31,"title":["Matroid Enumeration for Incidence Geometry"],"prefix":"10.1007","volume":"47","author":[{"given":"Yoshitake","family":"Matsumoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sonoko","family":"Moriyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Bremner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,11,30]]},"reference":[{"key":"9388_CR1","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1023\/A:1021231927255","volume":"19","author":"O. Aichholzer","year":"2002","unstructured":"Aichholzer, O., Aurenhammer, F., Krasser, H.: Enumerating order types for small point sets with applications. Order 19, 265\u2013281 (2002)","journal-title":"Order"},{"key":"9388_CR2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.comgeo.2005.07.005","volume":"36","author":"O. Aichholzer","year":"2006","unstructured":"Aichholzer, O., Krasser, H.: Abstract order type extension and new results on the rectilinear crossing number. Comput. Geom. 36, 2\u201315 (2006)","journal-title":"Comput. Geom."},{"key":"9388_CR3","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1002\/(SICI)1520-6610(1999)7:2<119::AID-JCD5>3.0.CO;2-W","volume":"7","author":"A. Betten","year":"1999","unstructured":"Betten, A., Betten, D.: Linear spaces with at most 12 points. J. Comb. Des. 7, 119\u2013145 (1999)","journal-title":"J. Comb. Des."},{"key":"9388_CR4","volume-title":"Oriented Matroids","year":"1999","unstructured":"Bj\u00f6rner, A., Las Vergnas, M., Sturmfels, B., White, S.N., Ziegler, G.M. (eds.): Oriented Matroids, 2nd edn. Cambridge University Press, Cambridge (1999)","edition":"2"},{"key":"9388_CR5","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1090\/S0025-5718-1973-0419270-0","volume":"27","author":"J.E. Blackburn","year":"1973","unstructured":"Blackburn, J.E., Crapo, H.H., Higgs, D.A.: A catalogue of combinatorial geometries. Math. Comput. 27, 155\u2013166 (1973)","journal-title":"Math. Comput."},{"key":"9388_CR6","doi-asserted-by":"crossref","unstructured":"Bremner, D., Bokowski, J., G\u00e9vay, G.: Symmetric matroid polytopes and their generation. Eur. J. Comb., in press (2008). http:\/\/dx.doi.org\/10.1016\/j.ejc.2008.12.006","DOI":"10.1016\/j.ejc.2008.12.006"},{"key":"9388_CR7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1023\/A:1018972901171","volume":"90","author":"A. Br\u00fcngger","year":"1999","unstructured":"Br\u00fcngger, A., Marzetta, A., Fukuda, K., Nievergelt, J.: The parallel search bench ZRAM and its applications. Ann. Oper. Res. 90, 45\u201363 (1999)","journal-title":"Ann. Oper. Res."},{"key":"9388_CR8","doi-asserted-by":"crossref","first-page":"55","DOI":"10.6028\/jres.069B.003","volume":"69B","author":"H.H. Crapo","year":"1965","unstructured":"Crapo, H.H.: Single-element extensions of matroids. J. Res. Natl. Bur. Stand. 69B, 55\u201365 (1965)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"9388_CR9","doi-asserted-by":"crossref","first-page":"30","DOI":"10.2307\/2687957","volume":"41","author":"D.W. Crowe","year":"1968","unstructured":"Crowe, D.W., McKee, T.A.: Sylvester\u2019s problem on collinear points. Math. Mag. 41, 30\u201334 (1968)","journal-title":"Math. Mag."},{"key":"9388_CR10","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02189318","volume":"9","author":"J. Csima","year":"1993","unstructured":"Csima, J., Sawyer, E.T.: There exist 6n\/13 ordinary points. Discrete Comput. Geom. 9, 187\u2013202 (1993)","journal-title":"Discrete Comput. Geom."},{"issue":"7","key":"9388_CR11","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Commun. ACM 5(7), 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"issue":"3","key":"9388_CR12","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7(3), 201\u2013215 (1960)","journal-title":"J. ACM"},{"key":"9388_CR13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1093\/qmath\/2.1.221","volume":"2","author":"G.A. Dirac","year":"1951","unstructured":"Dirac, G.A.: Collinearity properties of sets of points. Q. J. Math. 2, 221\u2013227 (1951)","journal-title":"Q. J. Math."},{"key":"9388_CR14","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Minisat page. http:\/\/minisat.se\/"},{"key":"9388_CR15","doi-asserted-by":"crossref","first-page":"65","DOI":"10.2307\/2304011","volume":"50","author":"P. Erd\u00f6s","year":"1943","unstructured":"Erd\u00f6s, P.: Problems for solution, # 4065. Am. Math. Mon. 50, 65 (1943)","journal-title":"Am. Math. Mon."},{"key":"9388_CR16","doi-asserted-by":"crossref","first-page":"169","DOI":"10.2307\/2303021","volume":"51","author":"P. Erd\u00f6s","year":"1944","unstructured":"Erd\u00f6s, P.: Solution of problem 4065. Am. Math. Mon. 51, 169\u2013171 (1944)","journal-title":"Am. Math. Mon."},{"key":"9388_CR17","first-page":"11","volume-title":"Algorithmic Studies in Combinatorics","author":"I.A. Faradzev","year":"1978","unstructured":"Faradzev, I.A.: Generation of nonisomorphic graphs with a given degree sequence. In: Algorithmic Studies in Combinatorics, pp. 11\u201319. Nauka, Moscow (1978) (Russian)"},{"key":"9388_CR18","unstructured":"Finschi, L.: A graph theoretical approach for reconstruction and generation of oriented matroids. PhD thesis, Swiss Federal Institute of Technology Zurich (2001)"},{"key":"9388_CR19","unstructured":"Finschi, L., Fukuda, K.: Homepage of oriented matroids. http:\/\/www.om.math.ethz.ch\/"},{"key":"9388_CR20","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s00454-001-0056-5","volume":"27","author":"L. Finschi","year":"2002","unstructured":"Finschi, L., Fukuda, K.: Generation of oriented matroids\u2014a graph theoretical approach. Discrete Comput. Geom. 27, 117\u2013136 (2002)","journal-title":"Discrete Comput. Geom."},{"key":"9388_CR21","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/978-3-642-55566-4_19","volume-title":"The Goodman-Pollack Festschrift","author":"L. Finschi","year":"2003","unstructured":"Finschi, L., Fukuda, K.: Complete combinatorial generation of small point configurations and hyperplane arrangements. In: Aronov, B., Pach, J. (eds.) The Goodman-Pollack Festschrift, pp. 425\u2013440. Springer, Berlin (2003)"},{"key":"9388_CR22","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0095-8956(78)90039-4","volume":"25","author":"J. Folkman","year":"1978","unstructured":"Folkman, J., Lawrence, J.: Oriented matroids. J. Comb. Theory, Ser. B 25, 199\u2013236 (1978)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9388_CR23","series-title":"CRC Press Series on Discrete Mathematics and Its Applications","doi-asserted-by":"crossref","DOI":"10.1201\/9781420035315","volume-title":"Handbook of Discrete and Computational Geometry","author":"J.E. Goodman","year":"2004","unstructured":"Goodman, J.E., O\u2019Rourke, J.: Handbook of Discrete and Computational Geometry. CRC Press Series on Discrete Mathematics and Its Applications, 2nd edn. CRC Press, Boca Raton (2004)","edition":"2"},{"key":"9388_CR24","first-page":"243","volume-title":"In Proc. 12th Biannual Intern. Seminar of the Canadian Math. Congress","author":"B. Gr\u00fcnbaum","year":"1970","unstructured":"Gr\u00fcnbaum, B.: The importance of being straight. In: In Proc. 12th Biannual Intern. Seminar of the Canadian Math. Congress, pp. 243\u2013254. Vancouver, 1969 (1970)"},{"key":"9388_CR25","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/978-3-642-01960-9_7","volume-title":"Algorithmic Algebraic Combinatorics and Gr\u00f6bner Bases","author":"R. Gugisch","year":"2009","unstructured":"Gugisch, R.: A construction of isomorphism classes of oriented matroids. In: Klin, M., Jones, G.A., Jurisic, A., Muzychuk, M., Ponomarenko, I. (eds.) Algorithmic Algebraic Combinatorics and Gr\u00f6bner Bases, pp. 229\u2013249. Springer, Berlin (2009)"},{"key":"9388_CR26","doi-asserted-by":"crossref","first-page":"175","DOI":"10.7146\/math.scand.a-10758","volume":"16","author":"S. Hansen","year":"1965","unstructured":"Hansen, S.: A generalization of a theorem of Sylvester to the lines determined by a finite point set. Math. Scand. 16, 175\u2013180 (1965)","journal-title":"Math. Scand."},{"key":"9388_CR27","unstructured":"Hansen, S.: Contributions to the Sylvester\u2013Gallai theory. PhD thesis, University of Copenhagen (1981)"},{"key":"9388_CR28","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.jctb.2007.07.005","volume":"98","author":"D. Mayhew","year":"2008","unstructured":"Mayhew, D., Royle, G.F.: Matroids with nine elements. J. Comb. Theory, Ser. B 98, 415\u2013431 (2008)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9388_CR29","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1006\/jagm.1997.0898","volume":"26","author":"B.D. McKay","year":"1998","unstructured":"McKay, B.D.: Isomorph-free exhaustive generation. J. Algorithms 26, 306\u2013324 (1998)","journal-title":"J. Algorithms"},{"key":"9388_CR30","first-page":"13","volume":"5","author":"E. Melchior","year":"1940","unstructured":"Melchior, E.: Uber vielseite der projektiven ebene. Deutsche Math. 5, 13 (1940)","journal-title":"Deutsche Math."},{"key":"9388_CR31","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1090\/S0002-9947-1951-0041447-9","volume":"70","author":"T. Motzkin","year":"1951","unstructured":"Motzkin, T.: The lines and planes connecting the points of a finite set. Trans. Am. Math. Soc. 70, 451\u2013464 (1951)","journal-title":"Trans. Am. Math. Soc."},{"key":"9388_CR32","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1090\/S0002-9947-1951-0041447-9","volume":"70","author":"Th. Motzkin","year":"1951","unstructured":"Motzkin, Th.: The lines and planes connecting the points of a finite set. Trans. Am. Math. Soc. 70, 451\u2013464 (1951)","journal-title":"Trans. Am. Math. Soc."},{"key":"9388_CR33","volume-title":"Matroid Theory","author":"J.G. Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid Theory. Oxford University Press, Oxford (1992)"},{"key":"9388_CR34","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0167-5060(08)70325-X","volume":"2","author":"R.C. Read","year":"1978","unstructured":"Read, R.C.: Every one a winner or how to avoid isomorphism search when cataloguing combinatorial configurations. Ann. Discrete Math. 2, 107\u2013120 (1978)","journal-title":"Ann. Discrete Math."},{"issue":"1","key":"9388_CR35","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1006\/aama.1999.0648","volume":"23","author":"J. Richter-Gebert","year":"1999","unstructured":"Richter-Gebert, J.: Testing orientability for matroids is NP-complete. Adv. Appl. Math. 23(1), 78\u201390 (1999)","journal-title":"Adv. Appl. Math."},{"key":"9388_CR36","unstructured":"Royle, G., Mayhew, D.: Small matroids. http:\/\/people.csse.uwa.edu.au\/gordon\/small-matroids.html"},{"key":"9388_CR37","unstructured":"Schewe, L.: Satisfiability problems in discrete geometry. Dissertation, TU Darmstadt (2007)"},{"key":"9388_CR38","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0095-8956(82)90054-5","volume":"33","author":"P.D. Seymour","year":"1982","unstructured":"Seymour, P.D.: On the points\u2013lines\u2013planes conjecture. J. Comb. Theory, Ser. B 33, 17\u201326 (1982)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9388_CR39","first-page":"231","volume":"45","author":"J.J. Sylvester","year":"1893","unstructured":"Sylvester, J.J.: Mathematical question 11851. Educ. Times 45, 231 (1893)","journal-title":"Educ. Times"},{"key":"9388_CR40","volume-title":"Matroid Theory","author":"D.J.A. Welsh","year":"1976","unstructured":"Welsh, D.J.A.: Matroid Theory. Academic Press, New York (1976)"},{"key":"9388_CR41","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF00181199","volume":"38","author":"G.M. Ziegler","year":"1991","unstructured":"Ziegler, G.M.: Some minimal non-orientable matroids of rank three. Geom. Dedic. 38, 365\u2013371 (1991)","journal-title":"Geom. Dedic."}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-011-9388-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-011-9388-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-011-9388-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T03:01:16Z","timestamp":1593313276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-011-9388-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,30]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["9388"],"URL":"https:\/\/doi.org\/10.1007\/s00454-011-9388-y","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,30]]}}}