{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:27:01Z","timestamp":1764131221737},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2002,10]]},"abstract":"<jats:p> We show that any two-colored set of n points in general position in the plane can be partitioned into at most [Formula: see text] monochromatic subsets, whose convex hulls are pairwise disjoint. This bound cannot be improved in general. We present an O(n log n) time algorithm for constructing a partition into fewer parts, if the coloring is unbalanced, i.e., the sizes of the two color classes differ by more than one. The analogous question for k-colored point sets (k &gt; 2) and its higher dimensional variant are also considered. <\/jats:p>","DOI":"10.1142\/s0218195902000943","type":"journal-article","created":{"date-parts":[[2002,10,17]],"date-time":"2002-10-17T06:34:41Z","timestamp":1034836481000},"page":"401-412","source":"Crossref","is-referenced-by-count":17,"title":["PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS"],"prefix":"10.1142","volume":"12","author":[{"given":"ADRIAN","family":"DUMITRESCU","sequence":"first","affiliation":[{"name":"Electrical Engineering and Computer Science,  University of Wisconsin \u2013 Milwaukee, Milwaukee, WI 53211, USA"}]},{"given":"J\u00c1NOS","family":"PACH","sequence":"additional","affiliation":[{"name":"Courant Institute of Mathematical Sciences,  251 Mercer Street, New York, NY 10012-1185, USA"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(89)90032-0"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057060"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.2307\/2373068"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574381"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009365"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(01)00007-4"},{"key":"p_8","first-page":"183","volume":"211","author":"Dumitrescu A.","year":"2000","journal-title":"Workshop on Algorithms and Data Structures"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579170"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01994880"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195902000943","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:27:55Z","timestamp":1565123275000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195902000943"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":9,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2002,10]]}},"alternative-id":["10.1142\/S0218195902000943"],"URL":"https:\/\/doi.org\/10.1142\/s0218195902000943","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}