A Counterexample to a Diameter Algorithm for Convex Polygons (Q3933768): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q52723829, #quickstatements; #temporary_batch_1710276387428 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q52723829 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:04, 12 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Counterexample to a Diameter Algorithm for Convex Polygons |
scientific article |
Statements
A Counterexample to a Diameter Algorithm for Convex Polygons (English)
0 references
1982
0 references
computational geometry
0 references
convex hull
0 references
image processing
0 references
region growing
0 references
scene analysis
0 references
