Algorithms for automatic generating interior nodal points and Delaunay triangulation using advancing front technique (Q5467012): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 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.1002/cnm.831 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2151998030 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Modification to the Suhara-Fukuda method of network generation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4225921 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:30, 24 June 2024
scientific article; zbMATH DE number 5025496
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for automatic generating interior nodal points and Delaunay triangulation using advancing front technique |
scientific article; zbMATH DE number 5025496 |
Statements
Algorithms for automatic generating interior nodal points and Delaunay triangulation using advancing front technique (English)
0 references
23 May 2006
0 references
arbitrary two-dimensional domain
0 references
generation of interior point set
0 references
Delaunay triangulation
0 references
advancing front technique
0 references
numerical examples
0 references
algorithm
0 references
Fortran 90 program
0 references
