Point placement algorithms for Delaunay triangulation of polygonal domains
type: Item
instance of: scholarly article
title: Point placement algorithms for Delaunay triangulation of polygonal domains
zbMATH Open document ID: 0938.68866
DOI: 10.1007/BF01377180
published in: Algorithmica
publication date: 1994-08-10T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 617041
author: Lee R. Nackman
author: Vijay Srinivasan
MaRDI profile type: Publication
cites work: Constrained Delaunay triangulations
cites work: Q3772828
cites work: A sweepline algorithm for Voronoi diagrams
cites work: Representing stereo data with the Delaunay triangulation
cites work: Delaunay-based representation of surfaces defined over arbitrarily shaped domains
cites work: Primitives for the manipulation of general subdivisions and the computation of Voronoi
cites work: Generalized Delaunay triangulation for planar graphs
cites work: Bisectors of linearly separable sets
cites work: Q3311639
cites work: Maximal Balls of Linearly Separable Sets
cites work: Delaunay triangulation of arbitrarily shaped planar domains
full work available at URL: https://doi.org/10.1007/bf01377180
OpenAlex ID: W2090162539
description: scientific article; zbMATH DE number 617041