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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q130248711, #quickstatements; #temporary_batch_1727994688163
 
(4 intermediate revisions by 4 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.15388/22-infor477 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4226341581 / 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: 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
Property / Wikidata QID
 
Property / Wikidata QID: Q130248711 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:00, 4 October 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