839 search results - page 121 / 168 » Three-Clustering of Points in the Plane |
SODA
2004
ACM
14 years 11 months ago
2004
ACM
For a rectilinear Steiner tree T with a root, define its k-th moment Mk(T) = T (dT (u))k du, where the integration is over all edges of T, dT (u) is the length of the unique path ...
COMGEO
2010
ACM
14 years 9 months ago
2010
ACM
The floodlight illumination problem asks whether there exists a one-to-one placement of n floodlights illuminating infinite wedges of angles 1, . . . , n at n sites p1, . . . , pn...
DM
2010
14 years 9 months ago
2010
Let H 2V be a hypergraph on vertex set V . For a positive integer r, we call H r-exact, if any minimal transversal of H intersects any hyperedge of H in at most r vertices. This ...
DCC
2008
IEEE
14 years 9 months ago
2008
IEEE
This work is inspired by a paper of Hertel and Pott on maximum non-linear functions [8]. Geometrically, these functions correspond with quasi-quadrics; objects introduced in [5]. ...
ENDM
2008
14 years 9 months ago
2008
For n 27 we present exact values for the maximum number h(n) of halving lines and h(n) of halving pseudolines, determined by n points in the plane. For this range of values of n ...