International Journal of Computational Geometry and Applications, Volume 19

Volume 19, Number 1, February 2009

• Yakov Nekrich:
  A Linear Space Data Structure for Orthogonal Range Reporting and Emptiness Queries. 1-15
  
• Dominique Faudot, Lionel Garnier:
  Initial Parametric Representation of Blobs. 17-32
  
• Ovidiu Daescu, James D. Palmer:
  Minimum Separation in Weighted Subdivisions. 33-57
  
• Borislav H. Simov, Giora Slutzki, Steven M. LaValle:
  Clearing a Polygon with Two 1-Searchers. 59-92
  

Volume 19, Number 2, April 2009

• Tetsuo Asano:
  Guest Editor's Foreword. 93
  
• Sang Won Bae, Jae-Hoon Kim, Kyung-Yong Chwa:
  Optimal Construction of the City Voronoi Diagram. 95-117
  
• Prosenjit Bose, Michiel H. M. Smid, Daming Xu:
  Delaunay and diamond Triangulations contain Spanners of Bounded Degree. 119-140
  
• Xiaodong Wu:
  Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications. 141-159
  
• Yusu Wang:
  Relations between Two Common Types of Rectangular Tilings. 161-172
  
• Khaled M. Elbassioni, Aleksei V. Fishkin, René Sitters:
  Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods. 173-193
  
• Scott E. Dillard, Vijay Natarajan, Gunther H. Weber, Valerio Pascucci, Bernd Hamann:
  Topology-Guided Tessellation of Quadratic Elements. 195-211
  

Volume 19, Number 3, June 2009

• Danny Z. Chen, D. T. Lee:
  Editors' Foreword. 213-214
  
• Gadi Aleksandrowicz, Gill Barequet:
  Counting d-Dimensional Polycubes and nonrectangular Planar polyominoes. 215-229
  
• Xiaodong Wu, Xin Dou, John E. Bayouth, John M. Buatti:
  Efficient Algorithm for Optimal Matrix Orthogonal Decomposition Problem in Intensity-Modulated Radiation Therapy. 231-246
  
• Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
  Restricted Mesh Simplification Using Edge Contractions. 247-265
  
• Marc Benkert, Joachim Gudmundsson, Christian Knauer, René van Oostrum, Alexander Wolff:
  A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. 267-288
  
• Sheung-Hung Poon:
  On Unfolding Lattice Polygons/Trees and Diameter-4 Trees. 289-321
  

Volume 19, Number 4, August 2009

• Jon G. Rokne:
  Guest Editor's Foreword. 323-324
  
• Stefan Porschen:
  On Rectangular Covering Problems. 325-340
  
• Marina L. Gavrilova:
  Determining a Set of Maximum Inscribed Rectangles for Label Placement in a Region. 341-356
  
• Debabrata Bardhan, Sasanka Roy, Sandip Das:
  Guard Placement for Maximizing L-Visibility Exterior to a Convex Polygon. 357-370
  
• D. Jiang, N. F. Stewart:
  Floating-Point Arithmetic for Computational Geometry Problems with Uncertain Data. 371-385