{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T17:42:25Z","timestamp":1750786945452},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489703"},{"type":"electronic","value":"9783662489710"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48971-0_43","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T04:00:57Z","timestamp":1448510457000},"page":"505-516","source":"Crossref","is-referenced-by-count":1,"title":["An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings"],"prefix":"10.1007","author":[{"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Kusters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Mulzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Pilz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Wettstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"key":"43_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/978-3-319-13075-0_2","volume-title":"Algorithms and Computation","author":"O Aichholzer","year":"2014","unstructured":"Aichholzer, O., Cardinal, J., Kusters, V., Langerman, S., Valtr, P.: Reconstructing point set order types from radial orderings. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 15\u201326. Springer, Heidelberg (2014)"},{"issue":"1","key":"43_CR2","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s00454-014-9644-z","volume":"53","author":"M Balko","year":"2015","unstructured":"Balko, M., Fulek, R., Kyn\u010dl, J.: Crossing numbers and combinatorial characterization of monotone drawings of \n                      \n                        \n                      \n                      $$K_n$$\n                    . Discrete Comput. Geom. 53(1), 107\u2013143 (2015)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"43_CR3","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BF01934990","volume":"25","author":"B Chazelle","year":"1985","unstructured":"Chazelle, B., Guibas, L.J., Lee, D.T.: The power of geometric duality. BIT 25(1), 76\u201390 (1985)","journal-title":"BIT"},{"issue":"2","key":"43_CR4","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/0215024","volume":"15","author":"H Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H., O\u2019Rourke, J., Seidel, R.: Constructing arrangements of lines and hyperplanes with applications. SIAM J. Comput. 15(2), 341\u2013363 (1986)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"43_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0012-365X(80)90096-5","volume":"32","author":"JE Goodman","year":"1980","unstructured":"Goodman, J.E.: Proof of a conjecture of Burr, Gr\u00fcnbaum, and Sloane. Discrete Math. 32(1), 27\u201335 (1980)","journal-title":"Discrete Math."},{"issue":"3","key":"43_CR6","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. Combin. Theor. Ser. A 37(3), 257\u2013293 (1984)","journal-title":"J. Combin. Theor. Ser. A"},{"key":"43_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-55611-7","volume-title":"Axioms and Hulls","author":"DE Knuth","year":"1992","unstructured":"Knuth, D.E.: Axioms and Hulls. LNCS, vol. 606. Springer, Heidelberg (1992)"},{"issue":"3","key":"43_CR8","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s00454-010-9320-x","volume":"45","author":"J Kyn\u010dl","year":"2011","unstructured":"Kyn\u010dl, J.: Simple realizability of complete abstract topological graphs in P. Discrete Comput. Geom. 45(3), 383\u2013399 (2011)","journal-title":"Discrete Comput. Geom."},{"key":"43_CR9","unstructured":"Pilz, A., Welzl, E.: Order on order types. In: Proceedings 31st International Symposium on Computational Geometry (SOCG 2015), pp. 285\u2013299. LIPICS (2015)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48971-0_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T17:52:46Z","timestamp":1559325166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48971-0_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489703","9783662489710"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48971-0_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}