![](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
International Journal of Computational Geometry and Applications, Volume 30
Volume 30, Number 1, March 2020
- Prosenjit Bose, Stephane Durocher
, Debajyoti Mondal, Maxime Peabody, Matthew Skala, Mohammad Abdul Wahid:
Local Routing in Convex Subdivisions. 1-17 - Daniel Kraft
:
Computing the Hausdorff Distance of Two Sets from Their Distance Functions. 19-49 - R. Inkulu
, K. Sowmya, Nitish P. Thakur:
Dynamic Algorithms for Visibility Polygons in Simple Polygons. 51-78 - Binayak Dutta
, Sasanka Roy:
Approximate Shortest Paths in Polygons with Violations. 79-95
Volume 30, Number 2, June 2020
- Bengt J. Nilsson
, Pawel Zylinski:
How to Keep an Eye on Small Things. 97-120 - Bogdan Grechuk, Sittichoke Som-Am
:
A Convex Cover for Closed Unit Curves has Area at Least 0.0975. 121-139 - Michael Kerber
, Arnur Nigmetov
:
Metric Spaces with Expensive Distances. 141-165
Volume 30, Numbers 3&4, September & December 2020
- Haitao Wang
, Yiming Zhao
:
A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space. 167-182 - Prashant Gupta
, Bala Krishnamoorthy
:
Euler Transformation of Polyhedral Complexes. 183-211 - Yangwei Liu, Hu Ding
, Ziyun Huang
, Jinhui Xu:
Distributed and Robust Support Vector Machine. 213-233 - Bastian Weiß, Bert Jüttler
, Franz Aurenhammer:
Mitered Offsets and Skeletons for Circular Arc Polygons. 235-256
![](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.