{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:21:23Z","timestamp":1725549683869},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_23","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T08:31:47Z","timestamp":1268382707000},"page":"256-268","source":"Crossref","is-referenced-by-count":2,"title":["Orthogonal Subdivisions with Low Stabbing Numbers"],"prefix":"10.1007","author":[{"given":"Csaba D.","family":"T\u00f3th","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/0221035","volume":"21","author":"P.K. Agarwal","year":"1992","unstructured":"Agarwal, P.K.: Ray shooting and other applications of spanning trees with low stabbing number. SIAM J. Comput.\u00a021, 540\u2013570 (1992)","journal-title":"SIAM J. Comput."},{"key":"23_CR2","first-page":"267","volume-title":"Proc. 11th Symp. Comput. Geom.","author":"P.K. Agarwal","year":"1995","unstructured":"Agarwal, P.K., Aronov, B., Suri, S.: Stabbing triangulations by lines in 3D. In: Proc. 11th Symp. Comput. Geom., pp. 267\u2013276. ACM, New York (1995)"},{"key":"23_CR3","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s00454-002-2817-1","volume":"28","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., de Berg, M., Gudmundsson, J., Hammar, M., Haverkort, H.J.: Box-trees and R-trees with near-optimal query time. Discrete Comput. Geom\u00a028, 291\u2013312 (2002)","journal-title":"Discrete Comput. Geom"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Amenta, N., Ziegler, G.M.: Shadows and slices of polytopes. In: Advances in Discrete & Computational Geometry. Contemp. Math., AMS, vol.\u00a0223, pp. 57\u201390. AMS, Providence (1999)","DOI":"10.1090\/conm\/223\/03132"},{"key":"23_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.comgeo.2004.07.005","volume":"31","author":"B. Aronov","year":"2005","unstructured":"Aronov, B., Br\u00f6nnimann, H., Chang, A.Y., Chiang, Y.-J.: Cost-driven octree construction schemes: an experimental study. Comput. Geom. Theory Appl.\u00a031, 127\u2013148 (2005)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"4","key":"23_CR6","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/PL00009436","volume":"21","author":"B. Aronov","year":"1999","unstructured":"Aronov, B., Fortune, S.: Approximating minimum-weight triangulations in three dimensions. Discrete Comput. Geom.\u00a021(4), 527\u2013549 (1999)","journal-title":"Discrete Comput. Geom."},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0925-7721(02)00112-8","volume":"24","author":"M. Berg de","year":"2003","unstructured":"de Berg, M., Gudmundsson, J., Hammar, M., Overmars, M.H.: On R-trees with low stabbing number. Comput. Geom. Theory Appl.\u00a024, 179\u2013195 (2003)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"4","key":"23_CR8","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0020-0190(94)90129-5","volume":"52","author":"M. Berg de","year":"1994","unstructured":"de Berg, M., van Kreveld, M.: Rectilinear decompositions with low stabbing number. Inform. Process. Lett.\u00a052(4), 215\u2013221 (1994)","journal-title":"Inform. Process. Lett."},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1015648719133","volume":"1","author":"P. Bose","year":"2002","unstructured":"Bose, P., Hurtado, F., Meijer, H., Ramaswami, S., Rappaport, D., Sacristan, V., Shermer, T.C., Toussaint, G.T.: Finding specified sections of arrangements: 2D results. J. Math. Model. Algorithms\u00a01, 3\u201316 (2002)","journal-title":"J. Math. Model. Algorithms"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02187720","volume":"4","author":"B. Chazelle","year":"1989","unstructured":"Chazelle, B., Edelsbrunner, H., Guibas, L.J.: The complexity of cutting complexes. Discrete Comput. Geom.\u00a04, 139\u2013181 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02187743","volume":"4","author":"B. Chazelle","year":"1989","unstructured":"Chazelle, B., Welzl, E.: Quasi-optimal range searching in space of finite VC-dimension. Discrete Comput. Geom.\u00a04, 467\u2013489 (1989)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"23_CR12","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/PL00009365","volume":"19","author":"T.K. Dey","year":"1998","unstructured":"Dey, T.K., Pach, J.: Extremal problems for geometric hypergraphs. Discrete Comput. Geom.\u00a019(4), 473\u2013484 (1998)","journal-title":"Discrete Comput. Geom."},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R. Dilworth","year":"1950","unstructured":"Dilworth, R.: A decomposition theorem for partially ordered sets. Ann. of Maths.\u00a051, 161\u2013166 (1950)","journal-title":"Ann. of Maths."},{"key":"23_CR14","first-page":"463","volume":"2","author":"P. Erd\u00f6s","year":"1935","unstructured":"Erd\u00f6s, P., Szekeres, G.: A combinatorial theorem in geometry. Compositio Math.\u00a02, 463\u2013470 (1935)","journal-title":"Compositio Math."},{"key":"23_CR15","first-page":"437","volume-title":"Proc. 15th Sympos. on Discrete Algorithms","author":"S.P. Fekete","year":"2004","unstructured":"Fekete, S.P., L\u00fcbbecke, M.E., Meijer, H.: Minimizing the stabbing number of matchings, trees, and triangulations. In: Proc. 15th Sympos. on Discrete Algorithms, pp. 437\u2013446. ACM, New York (2004)"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/jagm.2002.1221","volume":"43","author":"D. Gaur","year":"2002","unstructured":"Gaur, D., Ibaraki, T., Krishnamurti, R.: Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem. J. Algorithms\u00a043, 138\u2013152 (2002)","journal-title":"J. Algorithms"},{"key":"23_CR17","unstructured":"Held, M., Klosowski, J.T., Mitchell, J.S.B.: Evaluation of collision detection methods for virtual reality fly-throughs. In: Proc. 7th Canadian Conf. Comput. Geom., Quebec City, pp. 205\u2013210 (1995)"},{"issue":"3","key":"23_CR18","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1006\/jagm.1995.1017","volume":"18","author":"J. Hershberger","year":"1995","unstructured":"Hershberger, J., Suri, S.: A pedestrian approach to ray shooting: shoot a ray, take a walk. J. Algorithms\u00a018(3), 403\u2013431 (1995)","journal-title":"J. Algorithms"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1090\/S0002-9939-1953-0053256-2","volume":"4","author":"J.B. Kruskal","year":"1953","unstructured":"Kruskal, J.B.: Monotonic subsequences. Proc. Amer. Math. Soc.\u00a04, 264\u2013274 (1953)","journal-title":"Proc. Amer. Math. Soc."},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF02293051","volume":"8","author":"J. Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J.: Efficient partition trees. Discrete Comput. Geom.\u00a08, 315\u2013334 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Pach, J.: Notes on geometric graph theory. Discrete and computational geometry. In: DIMACS Ser. Discrete Math. Theor. Comp. Sci, vol.\u00a06, pp. 273\u2013285. AMS, Providence (1991)","DOI":"10.1090\/dimacs\/006\/19"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Shewchuk, J.R.: Stabbing Delaunay tetrahedralizations, manuscript (2004)","DOI":"10.1007\/s00454-004-1095-5"},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/3-540-55488-2_30","volume-title":"Data Structures and Efficient Algorithms","author":"E. Welzl","year":"1992","unstructured":"Welzl, E.: On spanning trees with low crossing numbers. In: Monien, B., Ottmann, T. (eds.) Data Structures and Efficient Algorithms. LNCS, vol.\u00a0594, pp. 233\u2013249. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:09:56Z","timestamp":1605625796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11534273_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}