Computing a subgraph of the minimum weight triangulation
type: Item
instance of: scholarly article
title: Computing a subgraph of the minimum weight triangulation
zbMATH Open document ID: 0807.68100
DOI: 10.1016/0925-7721(94)90014-0
author: J. Mark Keil
published in: Computational Geometry
publication date: 1995-03-01T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 590161
zbMATH Keywords: minimum weight triangulation
zbMATH Keywords: Euclidean graphs
MaRDI profile type: Publication
full work available at URL: 0925-7721(94)90014-0
OpenAlex ID: W1988781483
cites work: Q3138934
cites work: Q4763388
cites work: Q4198056
cites work: A note on Delaunay and optimal triangulations
cites work: Minimal Triangulations of Polygonal Domains
cites work: A New Heuristic for Minimum Weight Triangulation
cites work: Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
cites work: A heuristic triangulation algorithm
cites work: The \(\gamma\)-neighborhood graph
description: scientific article; zbMATH DE number 590161