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

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3628406
Language Label Description Also known as
default for all languages
No label defined
    English
    Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
    scientific article; zbMATH DE number 3628406

      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