An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. (Q6059944): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/12159/pdf/LIPIcs-SoCG-2020-1.pdf/ / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3037453711 / rank | |||
Normal rank | |||
| Property / title | |||
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. (English) | |||
| Property / title: An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. (English) / rank | |||
Normal rank | |||
Latest revision as of 09:12, 30 July 2024
scientific article; zbMATH DE number 7760130
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. |
scientific article; zbMATH DE number 7760130 |
Statements
2 November 2023
0 references
simple polygon
0 references
Ramsey theory
0 references
combinatorial geometry
0 references
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. (English)
0 references
