73 citations · 178 across the 49 of their papers we have counts for
Showing 2012 · cs.CGShow all
2 papers · 2 filters
cs.CG2012
Making Triangles Colorful
Jean Cardinal, Kolja Knauer, Piotr Micek +1
We prove that for any point set P in the plane, a triangle T, and a positive integer k, there exists a coloring of P with k colors such that any homothetic copy of T containing at…
cs.CG2012
Non-crossing Connectors in the Plane
Jan Kratochvíl, Torsten Ueckerdt
We consider the non-crossing connectors problem, which is stated as follows: Given n simply connected regions R_1,...,R_n in the plane and finite point sets P_i subset of R_i for i…