Volume 45, Numbers 1-2, January - February 2012

• 
  Frédéric Cazals, David Cohen-Steiner: Reconstructing 3D compact sets. 1-13
• 
  Imre Bárány, Hiroshi Maehara, Norihide Tokushige: Tetrahedra passing through a triangular hole, and tetrahedra fixed by a planar frame. 14-20
• 
  Hee-Kap Ahn, Otfried Cheong, Jirí Matousek, Antoine Vigneron: Reachability by paths of bounded curvature in a convex polygon. 21-32
• 
  Wei-Mei Chen, Hsien-Kuei Hwang, Tsung-Hsi Tsai: Maxima-finding algorithms for multidimensional samples: A two-phase approach. 33-53
• 
  A. Karim Abu-Affash, Rom Aschner, Paz Carmi, Matthew J. Katz: The MST of symmetric disk graphs is light. 54-61
• 
  Frédéric Hecht, Raphaël Kuate, Timothy Tautges: Local transformations of hexahedral meshes of lower valence. 62-71

Volume 45, Number 3, April 2012

• 
  Oswin Aichholzer, Franz Aurenhammer, Erik D. Demaine, Ferran Hurtado, Pedro Ramos, Jorge Urrutia: On k-convex polygons. 73-87
• 
  Rahnuma Islam Nishat, Debajyoti Mondal, Md. Saidur Rahman: Point-set embeddings of plane 3-trees. 88-98
• 
  Joondong Kim, Joseph S. B. Mitchell, Valentin Polishchuk, Shang Yang, Jingyu Zou: Routing multi-class traffic flows in the plane. 99-114
• 
  Gur Harary, Ayellet Tal: 3D Euler spirals for 3D curve completion. 115-126
• 
  Asish Mukhopadhyay, Eugene Greene: The ordinary line problem revisited. 127-130
• 
  János Pach, Andrew Suk, Miroslav Treml: Tangencies between families of disjoint regions in the plane. 131-138

Volume 45, Number 4, May 2012

• 
  Kurt Mehlhorn, Jörg-Rüdiger Sack: CGTA-Awards 2011. 139

• 
  Anka Gajentaan, Mark H. Overmars: On a class of O(n²) problems in computational geometry. 140-152

• 
  Mark de Berg, Dirk H. P. Gerrits: Approximation algorithms for free-label maximization. 153-168
• 
  Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Moric, Csaba D. Tóth: Graphs that admit right angle crossing drawings. 169-177
• 
  Dan Chen, Luc Devroye, Vida Dujmovic, Pat Morin: Memoryless routing in convex subdivisions: Random walks are optimal. 178-185
• 
  José H. Dulá, Francisco J. López: Competing output-sensitive frame algorithms. 186-197

Volume 45, Numbers 5-6, July 2012

• 
  David G. Kirkpatrick: Guest editorʼs foreword. 199

• 
  Mohammad Ali Abam, Sariel Har-Peled: New constructions of SSPDs and their applications. 200-214
• 
  Sergio Cabello, Éric Colin de Verdière, Francis Lazarus: Algorithms for the edge-width of an embedded graph. 215-224
• 
  Karl Bringmann: An improved algorithm for Kleeʼs measure problem on fat boxes. 225-233

• 
  Ernest Davis: Preserving geometric properties in reconstructing regions from internal and nearby points. 234-253
• 
  Danny Z. Chen, Haitao Wang: An improved algorithm for reconstructing a simple polygon from its visibility angles. 254-257
• 
  Javier Alonso, Horst Martini, Margarita Spirova: Minimal enclosing discs, circumcircles, and circumcenters in normed planes (Part I). 258-274

Volume 45, Number 7, August 2012

• 
  Benoit Beckers, Pierre Beckers: A general rule for disk and hemisphere partition into equal-area cells. 275-283
• 
  Sang Won Bae, Yoshio Okamoto: Querying two boundary points for shortest paths in a polygonal domain. 284-293
• 
  Sergey Bereg, Sergio Cabello, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Carlos Seara, Inmaculada Ventura: The class cover problem with boxes. 294-304
• 
  Chenyu Yan, Yang Xiang, Feodor F. Dragan: Compact and low delay routing labeling scheme for Unit Disk Graphs. 305-325
• 
  Adrian Dumitrescu, Csaba D. Tóth: Watchman tours for polygons with holes. 326-333
• 
  Chris Gray, Frank Kammer, Maarten Löffler, Rodrigo I. Silveira: Removing local extrema from imprecise terrains. 334-349
• 
  Javier Alonso, Horst Martini, Margarita Spirova: Minimal enclosing discs, circumcircles, and circumcenters in normed planes (Part II). 350-369
• 
  Adrian Dumitrescu: Going around in circles. 370-381

Volume 45, Number 8, October 2012

• 
  Xiao-Shan Gao, Robert Joan-Arinyo, Dominique Michelucci: Special issue on geometric constraints and reasoning. 383-384
• 
  Kirk Haller, Audrey Lee-St. John, Meera Sitharam, Ileana Streinu, Neil White: Body-and-cad geometric constraint systems. 385-405
• 
  Nicolas Magaud, Julien Narboux, Pascal Schreck: A case study in formalizing projective geometry in Coq: Desargues theorem. 406-424
• 
  Ching-Shoei Chiang, Christoph M. Hoffmann, Paul Rosen: A generalized Malfatti problem. 425-435
• 
  Christophe Brun, Jean-François Dufourd, Nicolas Magaud: Designing and proving correct a convex hull algorithm with hypermaps in Coq. 436-457
• 
  Gui-Fang Zhang: Classification of direct kinematics to planar generalized Stewart platforms. 458-473

Volume 45, Number 9, November 2012

• 
  Prosenjit Bose, Paz Carmi: Editorial. 475
• 
  Steven Bitner, Ovidiu Daescu: Minimum-sum dipolar spanning tree in R³. 476-481
• 
  Oswin Aichholzer, Günter Rote, André Schulz, Birgit Vogtenhuber: Pointed drawings of planar graphs. 482-494
• 
  Balázs Keszegh: Coloring half-planes and bottomless rectangles. 495-507
• 
  Matthew J. Katz, Nissan Lev-Tov, Gila Morgenstern: Conflict-Free Coloring of points on a line with respect to a set of intervals. 508-514
• 
  Joachim Giesen, Balint Miklos, Mark Pauly: The medial axis of the union of inner Voronoi balls in the plane. 515-523
• 
  Fabrizio Frati: Straight-line drawings of outerplanar graphs in O(dn log n) area. 524-533

last updated on Tue May 21 02:44:56 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page