{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:23:15Z","timestamp":1725456195250},"publisher-location":"Berlin\/Heidelberg","reference-count":20,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540582746"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0019430","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T06:16:42Z","timestamp":1132640202000},"page":"117-127","source":"Crossref","is-referenced-by-count":2,"title":["Orders, k-sets and fast halfplane search on paged memory"],"prefix":"10.1007","author":[{"given":"Paolo G.","family":"Franciosa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Talamo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Agarwal, P.K., Eppstein, D., Matou\u0161ek, J.: Dynamic half-space reporting, geometric optimization, and minimum spanning trees. Proc. 33rd Annu. IEEE Sympos. on Found. Comput. Sci. (1992) 80\u201389"},{"key":"8_CR2","volume-title":"Data Structures and Algorithms","author":"A.V. Aho","year":"1983","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison-Wesley, Reading, MA, 1983"},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF02573971","volume":"10","author":"H. Br\u00f6nnimann","year":"1993","unstructured":"Br\u00f6nnimann, H., Chazelle, B., Pach, J.: How hard is half-space reporting. Discrete & Comput. Geom. 10 (1993) 143\u2013155","journal-title":"Discrete & Comput. Geom."},{"key":"8_CR4","doi-asserted-by":"crossref","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 (1985) 76\u201390","journal-title":"BIT"},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0215051","volume":"15","author":"B. Chazelle","year":"1986","unstructured":"Chazelle, B.: Filtering search: a new approach to query-answering. SIAM J. on Comput. 15 (1986) 703\u2013724","journal-title":"SIAM J. on Comput."},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"K.L. Clarkson","year":"1989","unstructured":"Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry, II. Discrete & Comput. Geom. 4 (1989) 387\u2013421","journal-title":"Discrete & Comput. Geom."},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"600","DOI":"10.2307\/2371374","volume":"93","author":"B. Dushnik","year":"1941","unstructured":"Dushnik, B., Miller, E.W.: Partially ordered sets. American Journal of Mathematics 93 (1941) 600\u2013610","journal-title":"American Journal of Mathematics"},{"key":"8_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer-Verlag, Heidelberg, West Germany, 1987"},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/B978-0-7204-2262-7.50018-1","volume-title":"A Survey of Combinatorial Theory","author":"P. Erd\u0151s","year":"1973","unstructured":"Erd\u0151s, P., Lov\u00e1sz, L., Simmons, A., Straus, E.: Dissection graphs of planar point sets. In J.N. Srivastava editor, A Survey of Combinatorial Theory, North-Holland, Amsterdam, Netherlands, 1973, 139\u2013154"},{"key":"8_CR10","volume-title":"Interval Orders and Interval Graphs","author":"P.C. Fishburn","year":"1985","unstructured":"Fishburn, P.C.: Interval Orders and Interval Graphs. John Wiley & Sons, New York, NY, 1985"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Gambosi, G., Nesetril, J., Talamo, M.: On locally presented posets. Theoret. Comput. Sci. 68 (1990)","DOI":"10.1016\/0304-3975(90)90125-2"},{"key":"8_CR12","unstructured":"Giaccio, R., Talamo, M.: A general framework to deal with sets of intervals. In 8th National Conference on Logic Programming (GULP 93) Gizzeria Lido, Italy, 1993"},{"key":"8_CR13","unstructured":"Goodrich, M.T., Tsay, J., Vengroff, D.E., Vitter, J.S.: External-memory computational geometry. Proc. 34th Annu. IEEE Sympos. on Found. Comput. Sci. (1993) 714\u2013723"},{"key":"8_CR14","volume-title":"Technical Report 320\/1992","author":"M. Habib","year":"1992","unstructured":"Habib, M., Kelly, D., M\u00f6hring, R.H.: Comparability invariance of geometric notion of order dimension. Technical Report 320\/1992, Technical University of Berlin, Berlin, Germany, 1992"},{"key":"8_CR15","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0925-7721(92)90006-E","volume":"2","author":"J. Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J.: Reporting points in halfspaces. Comput. Geom. Theory & Appl. 2 (1992) 169\u2013186","journal-title":"Comput. Geom. Theory & Appl."},{"key":"8_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: an Introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: an Introduction. Springer-Verlag, New York, NY, 1985"},{"key":"8_CR17","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02187829","volume":"7","author":"J. Pach","year":"1992","unstructured":"Pach, J., Steiger, W., Szemer\u00e9di, E.: An upper bound on the number of planar k-sets. Discrete & Comput. Geom. 7 (1992) 109\u2013123","journal-title":"Discrete & Comput. Geom."},{"key":"8_CR18","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1137\/0402021","volume":"2","author":"N. Santoro","year":"1989","unstructured":"Santoro, N., Sidney, J.B., Sidney, S.J., Urrutia, J.: Geometric containment and partial orders. SIAM J. Disc. Math. 2 (1989) 245\u2013254","journal-title":"SIAM J. Disc. Math."},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Urrutia, J.: Partial orders and Euclidean geometry. In I. Rival editor, Algorithms and Order, Kluwer Academic Publishers, 1989, 387\u2013434","DOI":"10.1007\/978-94-009-2639-4_11"},{"key":"8_CR20","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02187686","volume":"1","author":"E. Welzl","year":"1986","unstructured":"Welzl, E.: More on k-sets of finite sets in the plane. Discrete & Comput. Geom. 1 (1986) 95\u2013100","journal-title":"Discrete & Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Orders, Algorithms, and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0019430.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:42:39Z","timestamp":1607550159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019430"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540582746"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0019430","relation":{},"subject":[]}}