{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:27:12Z","timestamp":1725571632364},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174575"},{"type":"electronic","value":"9783642174582"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17458-2_27","type":"book-chapter","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T06:12:57Z","timestamp":1292393577000},"page":"324-338","source":"Crossref","is-referenced-by-count":0,"title":["The Union of Colorful Simplices Spanned by a Colored Point Set"],"prefix":"10.1007","author":[{"given":"Andr\u00e9","family":"Schulz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00454-009-9177-z","volume":"42","author":"P. Afshani","year":"2009","unstructured":"Afshani, P., Chan, T.M.: On approximate range counting and depth. Discrete Comput. Geom.\u00a042(1), 3\u201321 (2009)","journal-title":"Discrete Comput. Geom."},{"key":"27_CR2","first-page":"809","volume-title":"Handbook of Discrete and Computational Geometry","author":"P.K. Agarwal","year":"2004","unstructured":"Agarwal, P.K.: Range searching. In: Goodman, J., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, ch.\u00a036, pp. 809\u2013838. CRC Press, Boca Raton (2004)"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1137\/0222051","volume":"22","author":"P.K. Agarwal","year":"1993","unstructured":"Agarwal, P.K., Matou\u0161ek, J.: Ray shooting and parametric search. SlAM J. Comput.\u00a022, 794\u2013806 (1993)","journal-title":"SlAM J. Comput."},{"key":"27_CR4","first-page":"1","volume-title":"Handbook of Computational Geometry","author":"P.K. Agarwal","year":"2000","unstructured":"Agarwal, P.K., Sharir, M.: Davenport-Schinzel sequences and their geometric applications. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, ch.\u00a01, pp. 1\u201347. Elsevier, Amsterdam (2000)"},{"key":"27_CR5","first-page":"1","volume-title":"Proceedings of the Third International Conference on Combinatorial Mathematics","author":"J. Akiyama","year":"1989","unstructured":"Akiyama, J., Alon, N.: Disjoint simplices and geometric hypergraphs. In: Proceedings of the Third International Conference on Combinatorial Mathematics, pp. 1\u20133. Academy of Sciences, New York (1989)"},{"issue":"3","key":"27_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1017\/S0963548300000225","volume":"1","author":"N. Alon","year":"1992","unstructured":"Alon, N., B\u00e1r\u00e1ny, I., F\u00fcredi, Z., Kleitman, D.J.: Point selections and weak \u03b5-nets for convex hulls. Combin. Probab. Comput.\u00a01(3), 189\u2013200 (1992)","journal-title":"Combin. Probab. Comput."},{"issue":"2","key":"27_CR7","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/s00454-009-9180-4","volume":"42","author":"J.L. Arocha","year":"2009","unstructured":"Arocha, J.L., B\u00e1r\u00e1ny, I., Bracho, J., Fabila, R., Montejano, L.: Very colorful theorems. Discrete Comput. Geom.\u00a042(2), 142\u2013154 (2009)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF02574371","volume":"12","author":"B. Aronov","year":"1994","unstructured":"Aronov, B., Sharir, M.: Castles in the air revisited. Discrete Comput. Geom.\u00a012(1), 119\u2013150 (1994)","journal-title":"Discrete Comput. Geom."},{"issue":"2-3","key":"27_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0012-365X(82)90115-7","volume":"40","author":"I. B\u00e1r\u00e1ny","year":"1982","unstructured":"B\u00e1r\u00e1ny, I.: A generalization of Carath\u00e9odory\u2019s theorem. Discrete Math.\u00a040(2-3), 141\u2013152 (1982)","journal-title":"Discrete Math."},{"key":"27_CR10","first-page":"11","volume":"6","author":"I. B\u00e1r\u00e1ny","year":"1997","unstructured":"B\u00e1r\u00e1ny, I., Onn, S.: Carath\u00e9odory\u2019s theorem, colourful and applicable. Bolyai Soc. Math. Stud., J\u00e1nos Bolyai Math. Soc., Budapest\u00a06, 11\u201321 (1997)","journal-title":"Bolyai Soc. Math. Stud., J\u00e1nos Bolyai Math. Soc., Budapest"},{"issue":"3","key":"27_CR11","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1287\/moor.22.3.550","volume":"22","author":"I. B\u00e1r\u00e1ny","year":"1997","unstructured":"B\u00e1r\u00e1ny, I., Onn, S.: Colourful linear programming and its relatives. Math. Oper. Res.\u00a022(3), 550\u2013567 (1997)","journal-title":"Math. Oper. Res."},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1142\/S021819599100013X","volume":"1","author":"J.-D. Boissonnat","year":"1991","unstructured":"Boissonnat, J.-D., Devillers, O., Preparata, F.P.: Computing the union of 3-colored triangles. Intern. J. Comput. Geom. Appl.\u00a01, 187\u2013196 (1991)","journal-title":"Intern. J. Comput. Geom. Appl."},{"key":"27_CR13","unstructured":"Cheng, A.Y., Ouyang, M.: On algorithms for simplicial depth. In: Canadian Conf. Comput. Geom., pp. 53\u201356 (2001)"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029813","volume-title":"Ray Shooting, Depth Orders and Hidden Surface Removal","author":"M. Berg de","year":"1993","unstructured":"de Berg, M.: Ray Shooting, Depth Orders and Hidden Surface Removal. LNCS, vol.\u00a0703. Springer, Heidelberg (1993); ch.\u00a05, Ray shooting from a fixed point, pp. 53\u201365"},{"key":"27_CR15","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, 473\u2013484 (1998)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"27_CR16","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s00454-006-1233-3","volume":"35","author":"A. Deza","year":"2006","unstructured":"Deza, A., Huang, S., Stephen, T., Terlaky, T.: Colourful simplicial depth. Discrete Comput. Geom.\u00a035(4), 597\u2013615 (2006)","journal-title":"Discrete Comput. Geom."},{"issue":"11","key":"27_CR17","doi-asserted-by":"publisher","first-page":"2166","DOI":"10.1016\/j.dam.2008.01.016","volume":"156","author":"A. Deza","year":"2008","unstructured":"Deza, A., Huang, S., Stephen, T., Terlaky, T.: The colourful feasibility problem. Discrete Appl. Math.\u00a0156(11), 2166\u20132177 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"27_CR18","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02187734","volume":"4","author":"H. Edelsbrunner","year":"1989","unstructured":"Edelsbrunner, H.: The upper envelope of piecewise linear functions: Tight bounds on the number of faces. Discrete Comput. Geom.\u00a04(1), 337\u2013343 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Ezra, E., Aronov, B., Sharir, M.: Improved bound for the union of fat triangles (2010) (manuscript)","DOI":"10.1137\/1.9781611973082.136"},{"key":"27_CR20","first-page":"525","volume-title":"Proc. 48th Sympos. on Foundations of Comp. Sci. (FOCS)","author":"E. Ezra","year":"2007","unstructured":"Ezra, E., Sharir, M.: Almost tight bound for the union of fat tetrahedra in three dimensions. In: Proc. 48th Sympos. on Foundations of Comp. Sci. (FOCS), pp. 525\u2013535. IEEE, Los Alamitos (2007)"},{"issue":"1-3","key":"27_CR21","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0012-365X(92)90658-3","volume":"108","author":"J. Gil","year":"1992","unstructured":"Gil, J., Steiger, W., Wigderson, A.: Geometric medians. Discrete Math.\u00a0108(1-3), 37\u201351 (1992)","journal-title":"Discrete Math."},{"issue":"6","key":"27_CR22","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/s00493-008-2427-5","volume":"28","author":"A.F. Holmsen","year":"2008","unstructured":"Holmsen, A.F., Pach, J., Tverberg, H.: Points surrounding the origin. Combinatorica\u00a028(6), 633\u2013644 (2008)","journal-title":"Combinatorica"},{"issue":"6","key":"27_CR23","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0020-0190(90)90217-L","volume":"33","author":"S. Khuller","year":"1990","unstructured":"Khuller, S., Mitchell, J.S.B.: On a triangle counting problem. Inf. Process. Lett.\u00a033(6), 319\u2013321 (1990)","journal-title":"Inf. Process. Lett."},{"key":"27_CR24","series-title":"Graduate Texts in Math","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J. Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Graduate Texts in Math, vol.\u00a0212. Springer, Heidelberg (2002)"},{"key":"27_CR25","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1137\/S009753979018330X","volume":"23","author":"J. Matou\u0161ek","year":"1994","unstructured":"Matou\u0161ek, J., Pach, J., Sharir, M., Sifrony, S., Welzl, E.: Fat triangles determine linearly many holes. SIAM J. Comput.\u00a023, 154\u2013169 (1994)","journal-title":"SIAM J. Comput."},{"key":"27_CR26","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s00454-003-2928-3","volume":"30","author":"J. Pach","year":"2003","unstructured":"Pach, J., Safruti, I., Sharir, M.: The union of congruent cubes in three dimensions. Discrete Comput. Geom.\u00a030, 133\u2013160 (2003)","journal-title":"Discrete Comput. Geom."},{"key":"27_CR27","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF02187732","volume":"4","author":"J. Pach","year":"1989","unstructured":"Pach, J., Sharir, M.: The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis. Discrete Comput. Geom.\u00a04, 291\u2013310 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"27_CR28","doi-asserted-by":"publisher","first-page":"1745","DOI":"10.1137\/S0097539700382169","volume":"31","author":"J. Pach","year":"2002","unstructured":"Pach, J., Tardos, G.: On the boundary complexity of the union of fat triangles. SIAM J. Comput.\u00a031, 1745\u20131760 (2002)","journal-title":"SIAM J. Comput."},{"key":"27_CR29","first-page":"809","volume-title":"Handbook of Discrete and Computational Geometry","author":"M. Pellegrini","year":"2004","unstructured":"Pellegrini, M.: Ray shooting and lines in space. In: Goodman, J., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, ch.\u00a036, pp. 809\u2013838. CRC Press, Boca Raton (2004)"},{"issue":"4","key":"27_CR30","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/BF02712877","volume":"16","author":"B. Tagansky","year":"1996","unstructured":"Tagansky, B.: A new technique for analyzing substructures in arrangements of piecewise linear surfaces. Discrete Comput. Geom.\u00a016(4), 455\u2013479 (1996)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"27_CR31","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0097-3165(92)90028-S","volume":"61","author":"R.T. \u017divaljevi\u0107","year":"1992","unstructured":"\u017divaljevi\u0107, R.T., Vre\u0107ica, S.T.: The colored Tverberg\u2019s problem and complexes of injective functions. J. Combin. Theory Ser. A\u00a061(2), 309\u2013318 (1992)","journal-title":"J. Combin. Theory Ser. A"},{"key":"27_CR32","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF02187894","volume":"3","author":"A. Wiernik","year":"1988","unstructured":"Wiernik, A., Sharir, M.: Planar realization of nonlinear Davenport Schinzel sequences by segments. Discrete Comput. Geom.\u00a03, 15\u201347 (1988)","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17458-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T22:57:22Z","timestamp":1559861842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17458-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174575","9783642174582"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17458-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}