On the power of the semi-separated pair decomposition (Q1947974): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.comgeo.2013.02.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2102958968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Region-fault tolerant geometric spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric spanners for weighted point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: New constructions of SSPDs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic algorithms for geometric spanners of small diameter: Randomized solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On separating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanners of Complete k-Partite Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered theta graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition of multidimensional point sets with applications to <i>k</i> -nearest-neighbors and <i>n</i> -body potential fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal partition trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5757089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data structures for range-aggregate extent queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5565133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delaunay triangulations of imprecise pointsin linear time after preprocessing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Spanner Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating largest convex hulls for imprecise points / rank
 
Normal rank

Latest revision as of 10:26, 6 July 2024

scientific article
Language Label Description Also known as
English
On the power of the semi-separated pair decomposition
scientific article

    Statements

    On the power of the semi-separated pair decomposition (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 April 2013
    0 references
    0 references
    semi-separated pair decomposition
    0 references
    closest-pair query
    0 references
    imprecise spanners
    0 references
    spanners for complete \(k\)-partite graphs
    0 references
    computational geometry
    0 references
    algorithm
    0 references
    0 references