235 search results - page 7 / 47 » The Complexity of Separating Points in the Plane |
109
click to vote
WADS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
COMSWARE
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— Control software in routers have gotten increasingly complex today. Further, since the control software runs in every router, managing a large network of routers is com...
80
Voted
ICRA
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper, we describe the components of a novel algorithm for the extraction of dominant orthogonal planar structures from monocular images taken in indoor environments. T...
COMGEO
2012
ACM
13 years 5 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
DAM
2007
14 years 9 months ago
2007
Digital planarity is defined by digitizing Euclidean planes in the three-dimensional digital space of voxels; voxels are given either in the grid point or the grid cube model. Th...