default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Computational Geometry, Volume 4
Volume 4, Number 1, 2013
- Gabriel Nivasch
, János Pach, Rom Pinchasi, Shira Zerbib:
The number of distinct distances from a vertex of a convex polygon. 1-12 - Michael Kerber:
Embedding the dual complex of hyper-rectangular partitions. 13-37 - Anne Driemel, Herman J. Haverkort, Maarten Löffler, Rodrigo I. Silveira:
Flow computations on imprecise terrains. 38-78 - Adrian Dumitrescu:
Metric inequalities for polygons. 79-93 - Bodo Manthey, Heiko Röglin:
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences. 94-132 - Sharif Ibrahim, Bala Krishnamoorthy, Kevin R. Vixie:
Simplicial flat norm with scale. 133-159 - Steven J. Gortler, Craig Gotsman, Ligang Liu, Dylan Thurston:
On affine rigidity. 160-181 - Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel, Christoph Doell, Carsten Grimm, Anil Maheshwari, Stefan Schirra, Michiel H. M. Smid:
Network Farthest-Point Diagrams. 182-211 - Mark de Berg, Krzysztof Onak, Anastasios Sidiropoulos:
Fat Polygonal Partitions with Applications to Visualization and Embeddings. 212-239 - Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt:
Making Triangles Colorful. 240-246
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.
last updated on 2024-11-07 20:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
