839 search results - page 71 / 168 » Three-Clustering of Points in the Plane |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— Routing dynamics heavily influence Internet data plane performance. Existing studies only narrowly focused on a few destinations and did not consider the predictability of the...
GD
2005
Springer
15 years 3 months ago
2005
Springer
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
GD
2007
Springer
15 years 4 months ago
2007
Springer
We present new algorithms for labeling a set P of n points in the plane with labels that are aligned to the left of the bounding box of P. The points are connected to their labels ...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...