235 search results - page 7 / 47 » The Complexity of Separating Points in the Plane |
211
click to vote
WADS
2009
Springer
16 years 19 days 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 ...
177
click to vote
COMSWARE
2006
IEEE
16 years 3 days 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...
160
click to vote
ICRA
2008
IEEE
16 years 15 days 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...
176
click to vote
COMGEO
2012
ACM
14 years 1 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...
129
click to vote
DAM
2007
15 years 6 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...