Computing the minimum weight triangulation of a set of linearly ordered points
type: Item
instance of: scholarly article
title: Computing the minimum weight triangulation of a set of linearly ordered points
zbMATH Open document ID: 0772.68106
DOI: 10.1016/0020-0190(92)90129-J
author: David Rappaport
author: Henk Meijer
published in: Information Processing Letters
publication date: 1993-01-16T00:00:00Z
review text: We describe an \(O(n^ k)\) time and space algorithm to obtain a minimum weight triangulation of a set of linearly ordered points.
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 92089
zbMATH Keywords: triangulation
MaRDI profile type: Publication
cites work: Q4198056
cites work: A note on Delaunay and optimal triangulations
cites work: Minimal Triangulations of Polygonal Domains
cites work: The greedy and Delaunay triangulations are not bad in the average case
cites work: Q3992847
full work available at URL: 0020-0190(92)90129-j
OpenAlex ID: W2091743544
description: scientific article; zbMATH DE number 92089