The greedy and Delaunay triangulations are not bad in the average case
type: Item
instance of: scholarly article
title: The greedy and Delaunay triangulations are not bad in the average case
zbMATH Open document ID: 0584.68080
DOI: 10.1016/0020-0190(86)90038-4
author: Andrzej Lingas
published in: Information Processing Letters
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3936537
zbMATH Keywords: computational geometry
zbMATH Keywords: minimum weight triangulation
zbMATH Keywords: greedy algorithm
zbMATH Keywords: Voronoi diagram
zbMATH Keywords: point distribution
MaRDI profile type: Publication
full work available at URL: 0020-0190(86)90038-4
OpenAlex ID: W2111409442
cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings
cites work: Parallel concepts in graph theory
cites work: A note on Delaunay and optimal triangulations
cites work: Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
description: scientific article; zbMATH DE number 3936537