{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T17:42:26Z","timestamp":1750786946179,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319130743"},{"type":"electronic","value":"9783319130750"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13075-0_2","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T16:37:06Z","timestamp":1415983026000},"page":"15-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reconstructing Point Set Order Typesfrom Radial Orderings"],"prefix":"10.1007","author":[{"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean","family":"Cardinal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Kusters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Valtr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,8]]},"reference":[{"issue":"3","key":"2_CR1","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1137\/0212032","volume":"12","author":"JE Goodman","year":"1983","unstructured":"Goodman, J.E., Pollack, R.: Multidimensional sorting. SIAM Journal on Computing 12(3), 484\u2013507 (1983)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Axioms and Hulls","year":"1992","unstructured":"Knuth, D.E. (ed.): Axioms and Hulls. LNCS, vol. 606. Springer, Heidelberg (1992)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rner, A., Las Vergnas, M., Sturmfels, B., White, N., Ziegler, G.: Oriented Matroids, 2nd edn. Cambridge University Press (1999)","DOI":"10.1017\/CBO9780511586507"},{"issue":"4","key":"2_CR4","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s00454-005-1164-4","volume":"33","author":"J Bokowski","year":"2005","unstructured":"Bokowski, J., King, S., Mock, S., Streinu, I.: The topological representation of oriented matroids. Discrete & Computational Geometry 33(4), 645\u2013668 (2005)","journal-title":"Discrete & Computational Geometry"},{"issue":"3","key":"2_CR5","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0097-3165(84)90050-5","volume":"37","author":"JE Goodman","year":"1984","unstructured":"Goodman, J.E., Pollack, R.: Semispaces of configurations, cell complexes of arrangements. J. Comb. Theory, Series A 37(3), 257\u2013293 (1984)","journal-title":"J. Comb. Theory, Series A"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Felsner, S.: On the number of arrangements of pseudolines. In: Proceedings of the Twelfth Annual Symposium on Computational Geometry, pp. 30\u201337. ACM (1996)","DOI":"10.1145\/237218.237232"},{"issue":"3","key":"2_CR7","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s00454-011-9366-4","volume":"46","author":"S Felsner","year":"2011","unstructured":"Felsner, S., Valtr, P.: Coding and counting arrangements of pseudolines. Discr. & Comp. Geom. 46(3), 405\u2013416 (2011)","journal-title":"Discr. & Comp. Geom."},{"key":"2_CR8","unstructured":"Pilz, A., Welzl, E.: Order on order-types. In preparation"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1090\/conm\/438\/08443","volume":"438","author":"B Tovar","year":"2007","unstructured":"Tovar, B., Freda, L., LaValle, S.M.: Using a robot to learn geometric information from permutations of landmarks. Contemporary Mathematics 438, 33\u201345 (2007)","journal-title":"Contemporary Mathematics"},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1142\/S0218195900000115","volume":"10","author":"SK Wismath","year":"2000","unstructured":"Wismath, S.K.: Point and line segment reconstruction from visibility information. Int. J. Comput. Geometry Appl. 10(2), 189\u2013200 (2000)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-13731-0_2","volume-title":"Algorithm Theory - SWAT 2010","author":"Y Disser","year":"2010","unstructured":"Disser, Y., Mihal\u00e1k, M., Widmayer, P.: Reconstructing a simple polygon from its angles. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 13\u201324. Springer, Heidelberg (2010)"},{"issue":"5\u20136","key":"2_CR12","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/j.comgeo.2012.01.005","volume":"45","author":"DZ Chen","year":"2012","unstructured":"Chen, D.Z., Wang, H.: An improved algorithm for reconstructing a simple polygon from its visibility angles. Comput. Geom. 45(5\u20136), 254\u2013257 (2012)","journal-title":"Comput. Geom."},{"issue":"4","key":"2_CR13","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1142\/S0218195907002343","volume":"17","author":"O Devillers","year":"2007","unstructured":"Devillers, O., Dujmovic, V., Everett, H., Hornus, S., Whitesides, S., Wismath, S.K.: Maintaining visibility information of planar point sets with a moving viewpoint. Int. J. Comput. Geometry Appl. 17(4), 297\u2013304 (2007)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-34191-5_10","volume-title":"Computational Geometry","author":"JM D\u00edaz-B\u00e1\u00f1ez","year":"2012","unstructured":"D\u00edaz-B\u00e1\u00f1ez, J.M., Fabila-Monroy, R., P\u00e9rez-Lantero, P.: On the number of radial orderings of colored planar point sets. In: M\u00e1rquez, A., Ramos, P., Urrutia, J. (eds.) EGC 2011. LNCS, vol. 7579, pp. 109\u2013118. Springer, Heidelberg (2012)"},{"key":"2_CR15","unstructured":"Durocher, S., Mehrabi, S., Mondal, D., Skala, M.: Realizing site permutations. In: CCCG. (2011)"},{"key":"2_CR16","unstructured":"Cardinal, J., Kusters, V.: The complexity of simultaneous geometric graph embedding. CoRR abs\/1302.7127 (2013)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13075-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T14:29:30Z","timestamp":1675348170000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13075-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319130743","9783319130750"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13075-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}