Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation
type: Item
instance of: scholarly article
title: Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation
zbMATH Open document ID: 0767.65099
DOI: 10.1016/0168-9274(93)90062-V
author: S. Singh
published in: Applied Numerical Mathematics
publication date: 1993-05-16T00:00:00Z
review text: This paper develops two simple algorithms for constructing two- dimensional constrained Delaunay triangulations. It is shown that these algorithms can be used in building constrained polygons within a convex hull. Simple examples are presented.
Mathematics Subject Classification ID: 65D18
Mathematics Subject Classification ID: 52B55
Mathematics Subject Classification ID: 32B25
zbMATH DE Number: 166550
zbMATH Keywords: iterative triangulation algorithm
zbMATH Keywords: algorithms
zbMATH Keywords: Delaunay triangulations
zbMATH Keywords: polygons
zbMATH Keywords: convex hull
reviewed by: Prabhat Kumar Mahanti
MaRDI profile type: Publication
cites work: A Constrained Two-Dimensional Triangulation and the Solution of Closest Node Problems in the Presence of Barriers
cites work: Primitives for the manipulation of general subdivisions and the computation of Voronoi
cites work: Properties of \(n\)-dimensional triangulations
cites work: Two algorithms for constructing a Delaunay triangulation
cites work: Geometry-based fully automatic mesh generation and the delaunay triangulation
cites work: A combined octree/delaunay method for fully automatic 3‐D mesh generation
cites work: The integrity of geometrical boundaries in the two-dimensional delaunay triangulation
full work available at URL: 0168-9274(93)90062-v
OpenAlex ID: W2080632690
Recommended article: A fast algorithm for generating constrained delaunay triangulations
Recommended article: Constrained Delaunay triangulations
Recommended article: A time-optimal delaunay refinement algorithm in two dimensions
Recommended article: Q4296140
Recommended article: Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time
Recommended article: Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time
Recommended article: Q5149099
Recommended article: A fast algorithm for constructing Delaunay triangulations in the plane
Recommended article: An algorithm for dynamic Delaunay triangulation of simple polygon
Recommended article: Duality of constrained Voronoi diagrams and Delaunay triangulations
description: scientific article; zbMATH DE number 166550