101
Voted
COMGEO
2011
ACM
14 years 6 months ago
2011
ACM
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...
119
Voted
COMGEO
2011
ACM
14 years 6 months ago
2011
ACM
A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...
97
Voted
COMGEO
2011
ACM
14 years 6 months ago
2011
ACM
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...
122
Voted
COMGEO
2011
ACM
14 years 6 months ago
2011
ACM
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
96
Voted
COMGEO
2011
ACM
14 years 6 months ago
2011
ACM
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the follo...
104
Voted
COMGEO
2011
ACM
14 years 6 months ago
2011
ACM
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k...
COMGEO
2011
ACM
14 years 6 months ago
2011
ACM
105
click to vote
COMGEO
2011
ACM
14 years 6 months ago
2011
ACM
In this note, we show that the size of the perimeter of (α, β)-covered objects is a linear function of the diameter. Specifically, for an (α, β)-covered object O, per(O) ≤ c...
100
click to vote
BWCCA
2010
14 years 6 months ago
2010
A wireless sensor network (WSN) is envisioned as a cluster of tiny power-constrained devices with functions of sensing and communications. Sensors closer to a sink node have a larg...