Adrian Dumitrescu  Home/Search
Context Related
| nyu.edu/~pach/publicati...dumitrescu.ps uwm.edu/faculty/ad/p.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: nyu.edu/~pach/publications/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: It is shown that any two-colored set of n points in general position in the plane can be partitioned into at most d n+1 2 e 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 > 2) and its higher dimensional... (Update)
Context of citations to this paper: More
.... colored versions of several results concerning finite point configurations have already been considered by many authors (see e.g. [1, 3, 11, 36]) the original motivation for us to study these problems came from a di#erent area. A finite set # of curves in the plane is a...
Cited by: More
On the Intersection Number of Matchings and Minimum.. - Merino, Salazar, Urrutia (2003) (Correct)
On Spanning Trees and Cycles of Multicolored Point Sets.. - Kano, Merino, Urrutia (2003) (Correct)
Chromatic Variants of the Erdös-Szekeres Theorem.. - Devillers.. (Correct)
Active bibliography (related documents): More All
0.5: Matching Colored Points in the Plane: Some New Results - Dumitrescu, Kaye (2001) (Correct)
0.2: The Complexity of Many Faces in the Overlay of Arrangements - Har-Peled (1995) (Correct)
0.1: Extremal Problems for Ordered (Hyper)Graphs: Applications of.. - Klazar (2002) (Correct)
Similar documents based on text: More All
0.3: Geometric Graphs With No Self-Intersecting Path of Length.. - Pach, Pinchasi, Tardos (2002) (Correct)
0.2: Relaxing Planarity for Topological Graphs - Pach, Radoicic, Toth (Correct)
0.2: The Union of Congruent Cubes in Three Dimensions - Pach, Safruti, Sharir (2001) (Correct)
Related documents from co-citation: More All
4: Ramsey-type results for geometric graphs - Karolyi, Pach et al. - 1997
2: Matching colored points in the plane (context) - Dumitrescu, Kaye - 2001
2: Geometric graph theory - Pach - 1999
BibTeX entry: (Update)
A. Dumitrescu and J. Pach. Partitioning colored point sets into monochromatic parts. Intern. J. Comp. Geom. Appl., 12:401--412, 2002. http://citeseer.ist.psu.edu/article/dumitrescu02partitioning.html More
@article{ dumitrescu00partitioning,
author = "Adrian Dumitrescu and J{\'a}nos Pach",
title = "Partitioning Colored Point Sets into Monochromatic Parts",
journal = "Lecture Notes in Computer Science",
volume = "2125",
pages = "264--??",
year = "2000",
url = "citeseer.ist.psu.edu/article/dumitrescu02partitioning.html" }
Citations (may not include all citations):1450 The Design and analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
214 Davenport-Schinzel Sequences and Their Geometric Application.. - Sharir, Agarwal - 1995
93 IEEE Transactions on Information Theory (context) - Chazelle, convex et al. - 1985
88 Data Structures and Algorithms 3: Multi-dimensional searchin.. (context) - Mehlhorn - 1984
75 Nonlinearity of Davenport-Schinzel sequences and of generali.. (context) - Hart, Sharir - 1986
72 Art Gallery Theorems and Algorithms (context) - O'Rourke - 1987
54 Sharp upper and lower bounds for the length of general Daven.. (context) - Agarwal, Sharir et al. - 1989
40 Applications of a semi-dynamic convex hull algorithm (context) - Hershberger, Suri - 1992
33 An Introduction through Randomized Algorithms (context) - Mulmuley, Geometry - 1994
31 Counting triangle crossings and halving planes (context) - Dey, Edelsbrunner - 1994
9 Extremal problems for geometric hypergraphs - Dey, Pach - 1998
6 A combinatorial problem connected with di erential equations (context) - Davenport, Schinzel - 1965
2 Workshop on Algorithms and Data Structures (context) - Dumitrescu, Steiger et al.
1 Matching colored points in the plane: some new results - Dumitrescu, Kaye - 2001
Documents on the same site (http://www.math.nyu.edu/~pach/publications/): More
An Algorithm for Finding Many Disjoint Monochromatic Edges in.. - Károlyi, al. (Correct)
Cellular Telephone Networks and Random Maps in Hypergraphs - Halpert, Lengyel, Pach (1999) (Correct)
A generalization of the Erdös-Szekeres theorem to disjoint.. - Pach, Tóth (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC