The widest k-dense corridor problems (Q1274672): Difference between revisions
From MaRDI portal
Added link to MaRDI 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 / cites work | |||
| Property / cites work: The K-dense corridor problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Applications of random sampling in computational geometry. II / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3772828 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The widest k-dense corridor problems / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(98)00130-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1985491096 / rank | |||
Normal rank | |||
Latest revision as of 10:58, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The widest k-dense corridor problems |
scientific article |
Statements
The widest k-dense corridor problems (English)
0 references
12 January 1999
0 references
Computational geometry
0 references
Geometric duality
0 references
Arrangement
0 references
Levels
0 references
Corridors
0 references
