Efficient Speed-Up of the Smallest Enclosing Circle Algorithm (Q5040739): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Computing the smallest k-enclosing circle and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the smallest \(k\)-enclosing circle and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for computing the smallest \(k\)-enclosing circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm for computing the smallest enclosing circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution methodologies for the smallest enclosing circle problem / rank
 
Normal rank

Revision as of 11:08, 30 July 2024

scientific article; zbMATH DE number 7602687
Language Label Description Also known as
English
Efficient Speed-Up of the Smallest Enclosing Circle Algorithm
scientific article; zbMATH DE number 7602687

    Statements

    Efficient Speed-Up of the Smallest Enclosing Circle Algorithm (English)
    0 references
    0 references
    0 references
    0 references
    18 October 2022
    0 references
    smallest enclosing circle
    0 references
    space subdivision
    0 references
    convex hull
    0 references
    speed-up
    0 references
    Weltzl's algorithm
    0 references

    Identifiers