Ackerman, Eyal and Keszegh, Balázs and Rote, Günter (2022) An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. DISCRETE AND COMPUTATIONAL GEOMETRY : AN INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE. pp. 1-29. ISSN 0179-5376 (print); 1432-0444 (online)
|
Text
s00454-022-00438-0.pdf Available under License Creative Commons Attribution. Download (1MB) | Preview |
Official URL: https://doi.org/10.1007/s00454-022-00438-0
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA73 Geometry / geometria |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 18 Oct 2022 07:23 |
| Last Modified: | 18 Oct 2022 07:23 |
| URI: | http://real.mtak.hu/id/eprint/151840 |
Actions (login required)
 |
Edit Item |
