The Journal of Computational Geometry (JoCG) is an international open access journal devoted to publishing original research of the highest quality in all aspects of computational geometry.
JoCG articles and supplementary data are freely available for download and JoCG charges no publishing fees of any kind.
All JoCG issues and articles are assigned a DOI. JoCG's data and content are safeguarded through several backup mechanisms.
JoCG is a member of the Free Journal Network.
比特浏览器vnp-vp加速器官网
News: JoCG included as a listing in MathSciNet |
|
| Mathematical Reviews is now including the Journal of Computational Geometry [ISSN: 1920-180X] as a listing in MathSciNet. | |
| Posted: 2017-09-21 | |
News: DOIs for Articles and Issues |
|
| JoCG now has unique Document Object Identifiers (DOIs) for each article and issue. | |
| Posted: 2016-08-10 | More... |
Cyber regulators deny rumors they approved VPN …:China's cyber regulators have denied they have given a company green light to sell VPN services in the nation, stating it was Cyber regulators deny rumors they approved VPN service Global Times Published: 2021-07-10 15:29:38 |
|
| JoCG is now included in Thomson-Reuters Emerging Sources Citation Index. | |
| 蚂蚁免费版ⅴpn | More... |
| More Announcements... |
比特浏览器vnp-vp加速器官网
比特浏览器vnp-vp加速器官网
Articles
|
On optimal polyline simplification using the Hausdorff and Fréchet distance
Marc van Kreveld, Maarten Löffler, Lionov Wiratma
|
PDF
1–25
|
|
Stable-matching Voronoi diagrams: Combinatorial complexity and algorithms
Gill Barequet, David Eppstein, Michael Goodrich, Nil Mamano
|
PDF
26–59
|
|
New lower bounds for the number of pseudoline arrangements
Adrian Dumitrescu, Ritankar Mandal
|
PDF
蚂蚁vp加速器官网下载
|
|
Rigid foldability is NP-hard
Hugo Akitaya, Erik Demaine, Takashi Horiyama, Thomas Hull, Jason Ku, Tomohiro Tachi
|
PDF
93–124
|
|
Determining hyperbolicity of compact orientable 3-manifolds with torus boundary
一个神奇的网站:2021-3-23 · 本站文章部分内容转载自互联网，供读者交流和学习，如有涉及作者版权问题请及时与我伔联系，众便更正或删除。感谢所有提供信息材料的网站，并欢迎各类媒体与我伔进行文章共享合作。
|
PDF
125–136
|
|
On the planar edge-length ratio of planar graphs
Manuel Borrazzo, Fabrizio Frati
|
PDF
137–155
|
|
Algorithms for the discrete Fréchet distance under translation
Omrit Filtser, Matthew Katz
|
PDF
156–175
|