Well-separated pair decomposition in linear time? (Q963421): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.ipl.2008.02.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094974501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting in linear time? / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for approximate nearest neighbor searching fixed dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast geometric approximation techniques and geometric embedding problems / 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: Q4828970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trans-dichotomous algorithms for minimum spanning trees and shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic sorting in O(nloglogn) time and linear space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized linear-time algorithm to find minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Spanner Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Spanning Trees in <i>k</i>-Dimensional Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparse graph almost as good as the complete graph on points in \(k\) dimensions / rank
 
Normal rank

Latest revision as of 17:32, 2 July 2024

scientific article
Language Label Description Also known as
English
Well-separated pair decomposition in linear time?
scientific article

    Statements

    Well-separated pair decomposition in linear time? (English)
    0 references
    0 references
    19 April 2010
    0 references
    0 references
    computational geometry
    0 references
    approximation algorithms
    0 references
    quadtrees
    0 references
    0 references