COMPUTING THE DIAMETER OF A POINT SET (Q4818574): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: Applications of random sampling in computational geometry. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\). / 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: On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:56, 7 June 2024

scientific article; zbMATH DE number 2104275
Language Label Description Also known as
English
COMPUTING THE DIAMETER OF A POINT SET
scientific article; zbMATH DE number 2104275

    Statements

    COMPUTING THE DIAMETER OF A POINT SET (English)
    0 references
    29 September 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    diameter
    0 references
    width
    0 references
    approximation
    0 references
    point sets
    0 references
    furthest neighbors
    0 references
    double normal
    0 references