839 search results - page 141 / 168 » Three-Clustering of Points in the Plane |
178
click to vote
WADS
2009
Springer
16 years 21 days ago
2009
Springer
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
144
click to vote
DCOSS
2009
Springer
16 years 20 days ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
155
click to vote
ESA
2009
Springer
16 years 20 days ago
2009
Springer
According to a classical result of Gr¨unbaum, the transversal number τ(F) of any family F of pairwise-intersecting translates or homothets of a convex body C in Rd is bounded by...
149
click to vote
COMPGEOM
2009
ACM
16 years 19 days ago
2009
ACM
A topological graph is a graph drawn in the plane with vertices represented by points and edges as arcs connecting its vertices. A k-grid in a topological graph is a pair of edge ...
211
click to vote
SMA
2009
ACM
16 years 18 days ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...