A simple aggregative algorithm for counting triangulations of planar point sets and related problems (Q5174454): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user 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.1145/2462356.2462392 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2004367845 / rank | |||
Normal rank | |||
Latest revision as of 02:13, 20 March 2024
scientific article; zbMATH DE number 6405105
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple aggregative algorithm for counting triangulations of planar point sets and related problems |
scientific article; zbMATH DE number 6405105 |
Statements
A simple aggregative algorithm for counting triangulations of planar point sets and related problems (English)
0 references
17 February 2015
0 references
counting
0 references
geometric graphs
0 references
triangulations
0 references
