![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Computational Geometry, Volume 111
Volume 111, April 2023
- Peyman Afshani, Rasmus Killmann:
Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions. 101959
- Evgeniy Vodolazskiy
:
Discrete Fréchet distance for closed curves. 101967
- Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
:
Complexity results on untangling red-blue matchings. 101974
- Sujoy Bhore, Guangping Li
, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu:
Untangling circular drawings: Algorithms and complexity. 101975 - Sarita de Berg
, Frank Staals:
Dynamic data structures for k-nearest neighbor queries. 101976
- Satyan L. Devadoss
, Matthew S. Harvey:
Unfoldings and nets of regular polytopes. 101977
- Markus Baumeister
, Leif Kobbelt:
How close is a quad mesh to a polycube? 101978
- Katharina Klost
:
An algorithmic framework for the single source shortest path problem with applications to disk graphs. 101979 - Emilio Di Giacomo, Fabrizio Montecchiani:
Editorial. 101980
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.