On Some Proximity Problems of Colored Sets (Q2867120): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of d-dimensional Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for the all-nearest-neighbors problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean minimum spanning trees and bichromatic closest pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-dimensional Voronoi diagrams in linear expected time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Farthest neighbors, maximum spanning trees and related problems in higher dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal time bounds for some proximity problems in the plane / 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: Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal deterministic algorithm for computing the diameter of a three-dimensional point set / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING THE DIAMETER OF A POINT SET / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme Distances in Multicolored Point Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing farthest neighbors on a convex polytope. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Construction of Nets in Low-Dimensional Metrics and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Minimum Diameter Color-Spanning Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some geometric problems of color-spanning sets / rank
 
Normal rank

Latest revision as of 03:17, 7 July 2024

scientific article
Language Label Description Also known as
English
On Some Proximity Problems of Colored Sets
scientific article

    Statements

    On Some Proximity Problems of Colored Sets (English)
    0 references
    0 references
    0 references
    0 references
    10 December 2013
    0 references

    Identifiers