Journal: Comput. Geom.

Volume 37, Issue 3

141 -- 0Carmen Cortés, Alberto Márquez. Editorial
142 -- 154Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos. Approximate distance oracles for graphs with dense clusters
155 -- 161Oswin Aichholzer, Klaus Reinhardt. A quadratic distance bound on sliding between crossing-free spanning trees
162 -- 174Günter Rote. Computing the Fréchet distance between piecewise smooth curves
175 -- 187Marc J. van Kreveld, Bettina Speckmann. On rectangular cartograms
188 -- 208Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein. Geometric dilation of closed planar curves: New lower bounds
209 -- 227Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold. Space-efficient geometric divide-and-conquer algorithms

Volume 37, Issue 2

59 -- 71Adrian Kosowski, Michal Malafiejski, Pawel Zylinski. Cooperative mobile guards in grids
72 -- 103Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez. Complexity of the minimum-length corridor problem
104 -- 114Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff. Configurations with few crossings in topological graphs
115 -- 133Sasanka Roy, Sandip Das, Subhas C. Nandy. Shortest monotone descent path problem in polyhedral terrain
134 -- 140L. Pournin, Thomas M. Liebling. Constrained paths in the flip-graph of regular triangulations

Volume 37, Issue 1

1 -- 2Ferran Hurtado, Joseph S. B. Mitchell. Editorial
3 -- 15Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-Su Shin, Antoine Vigneron. Maximizing the overlap of two planar convex sets under rigid motions
16 -- 26Mohammad Ali Abam, Mark de Berg. Kinetic sorting and kinetic convex hulls
27 -- 37David Eppstein, Kevin A. Wortman. Minimum dilation stars
38 -- 58Jean-Daniel Boissonnat, Leonidas J. Guibas, Steve Oudot. Learning smooth shapes by probing