An algorithm for dynamic Delaunay triangulation of simple polygon (Q2887614)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for dynamic Delaunay triangulation of simple polygon |
scientific article; zbMATH DE number 6042003
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for dynamic Delaunay triangulation of simple polygon |
scientific article; zbMATH DE number 6042003 |
Statements
1 June 2012
0 references
simple polygon
0 references
Delaunay triangulation
0 references
empty circle
0 references
Python language
0 references
algorithm
0 references
mesh generation
0 references
0.9181094
0 references
0.9157729
0 references
0.91275084
0 references
0.8985593
0 references
0.89626855
0 references
0.8960291
0 references
0.89531326
0 references
An algorithm for dynamic Delaunay triangulation of simple polygon (English)
0 references
