Loading...
Search for: separation
0.021 seconds
Total 682 records

    On the power of the semi-separated pair decomposition

    , Article Computational Geometry: Theory and Applications ; Volume 46, Issue 6 , 2013 , Pages 631-639 ; 09257721 (ISSN) Abam, M. A ; Carmi, P ; Farshi, M ; Smid, M ; Sharif University of Technology
    2013
    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 DAi and DBi containing Ai and Bi respectively such that d(DAi,DBi)≥s×min(radius(DAi), radius(DBi)), and for any two points p,qâ̂̂S there is a unique index i such that pâ̂̂Ai and qâ̂̂Bi or vice versa. In this paper, we use the SSPD to obtain the following results: First, we consider the construction of geometric t-spanners in the context of imprecise points and we prove that any set SâŠ"Rd of n imprecise points, modeled as pairwise disjoint balls, admits a t-spanner with O(nlogn/(t-1)d) edges that can be computed in O(nlogn/(t-1)d)... 

    New constructions of SSPDs and their applications

    , Article Computational Geometry: Theory and Applications ; Volume 45, Issue 5-6 , 2012 , Pages 200-214 ; 09257721 (ISSN) Abam, M. A ; Har Peled, S ; Sharif University of Technology
    2012
    Abstract
    We present a new optimal construction of a semi-separated pair decomposition (i.e., SSPD) for a set of n points in Rd. In the new construction each point participates in a few pairs, and it extends easily to spaces with low doubling dimension. This is the first optimal construction with these properties. As an application of the new construction, for a fixed t>1, we present a new construction of a t-spanner with O(n) edges and maximum degree O( log2n) that has a separator of size O(n1 -1/d)