Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation (Q1256860): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Glenn K. Manacher / rank
Normal rank
 
Property / author
 
Property / author: Glenn K. Manacher / rank
 
Normal rank
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.1016/0020-0190(79)90104-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964316024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4744064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5568974 / rank
 
Normal rank

Latest revision as of 01:02, 13 June 2024

scientific article
Language Label Description Also known as
English
Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
scientific article

    Statements

    Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation (English)
    0 references
    0 references
    0 references
    1979
    0 references
    triangulation of a planar point set
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references

    Identifiers