COMGEO
2011
ACM
13 years 2 months ago
2011
ACM
ABSTRACT . Categories and Subject Descriptors K. Computing Milieux K.m MISCELLANEOUS General Terms Theory Keywords Cyber-physics, Internet of Things, Quantum computing Cloud Comput...
COMGEO
2011
ACM
13 years 2 months ago
2011
ACM
COMGEO
2011
ACM
13 years 2 months ago
2011
ACM
Skyhook Wireless provides hybrid positioning to millions of mobile devices around the world. Using an approach that integrates cell, WiFi, and GPS signals, the system services ove...
COMGEO
2011
ACM
13 years 5 months ago
2011
ACM
COMGEO
2011
ACM
13 years 5 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/...
COMGEO
2011
ACM
13 years 5 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 ...
COMGEO
2011
ACM
13 years 5 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 ...
COMGEO
2011
ACM
13 years 5 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...
COMGEO
2011
ACM
13 years 5 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...
COMGEO
2011
ACM
13 years 5 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...