An algorithm for dynamic Delaunay triangulation of simple polygon
type: Item
instance of: scholarly article
zbMATH Open document ID: 1249.65044
author: Xiaohua Luo
author: Wenchao Fu
author: Peixiang Guan
author: Chuanlin Zhang
publication date: 2012-06-01T00:00:00Z
Mathematics Subject Classification ID: 65D18
zbMATH DE Number: 6042003
zbMATH Keywords: simple polygon
zbMATH Keywords: Delaunay triangulation
zbMATH Keywords: empty circle
zbMATH Keywords: Python language
zbMATH Keywords: algorithm
zbMATH Keywords: mesh generation
MaRDI profile type: Publication
Recommended article: An optimal algorithm for realizing a Delaunay triangulation
Recommended article: A contribution to triangulation algorithms for simple polygons
Recommended article: A fast algorithm for constructing Delaunay triangulations in the plane
Recommended article: Q4220272
Recommended article: A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems
Recommended article: Dynamic Algorithms for Visibility Polygons in Simple Polygons
Recommended article: Q5501286
Recommended article: A faster divide-and-conquer algorithm for constructing Delaunay triangulations
Recommended article: A fast algorithm for generating constrained delaunay triangulations
describes a project that uses: Python
title: An algorithm for dynamic Delaunay triangulation of simple polygon
published in: Journal of Jinan University. Natural Science \& Medicine Edition
description: scientific article; zbMATH DE number 6042003