A fast algorithm for generating constrained delaunay triangulations (Q4203600): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0045-7949(93)90239-a / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044536971 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:31, 30 July 2024
scientific article; zbMATH DE number 410172
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for generating constrained delaunay triangulations |
scientific article; zbMATH DE number 410172 |
Statements
A fast algorithm for generating constrained delaunay triangulations (English)
0 references
8 September 1993
0 references
fast algorithm
0 references
constrained Delaunay triangulation
0 references
