An optimal algorithm for realizing a Delaunay triangulation (Q287080): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68U05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 52B55 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6585419 / rank
 
Normal rank
Property / zbMATH Keywords
 
Delaunay triangulation
Property / zbMATH Keywords: Delaunay triangulation / rank
 
Normal rank
Property / zbMATH Keywords
 
realizability
Property / zbMATH Keywords: realizability / rank
 
Normal rank
Property / zbMATH Keywords
 
computational geometry
Property / zbMATH Keywords: computational geometry / rank
 
Normal rank
Property / zbMATH Keywords
 
convex polygons
Property / zbMATH Keywords: convex polygons / rank
 
Normal rank

Revision as of 18:54, 27 June 2023

scientific article
Language Label Description Also known as
English
An optimal algorithm for realizing a Delaunay triangulation
scientific article

    Statements

    An optimal algorithm for realizing a Delaunay triangulation (English)
    0 references
    0 references
    26 May 2016
    0 references
    Delaunay triangulation
    0 references
    realizability
    0 references
    computational geometry
    0 references
    convex polygons
    0 references

    Identifiers