Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
type: Item
instance of: scholarly article
title: Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
zbMATH Open document ID: 0404.68070
DOI: 10.1016/0020-0190(79)90104-2
author: Albert L. Zobrist
author: Glenn K. Manacher
published in: Information Processing Letters
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 05B40
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3628406
zbMATH Keywords: triangulation of a planar point set
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: 0020-0190(79)90104-2
OpenAlex ID: W1964316024
cites work: Q4744064
cites work: Q4144192
cites work: Q5568974
description: scientific article; zbMATH DE number 3628406