Volume 15, Number 1, February 2005

• 
  Paul Chew, Alper Üngör: Guest editors' foreword. 1-2
• 
  Daniel K. Blandford, Guy E. Blelloch, David E. Cardoze, Clemens Kadow: Compact representations of simplicial meshes in two and three dimensions. 3-24
• 
  Gary L. Miller, Steven E. Pav, Noel Walkington: When and why delaunay refinement algorithms work. 25-54
• 
  Suneeta Ramaswami, Marcelo Siqueira, Tessa A. Sundaram, Jean H. Gallier, James C. Gee: Constrained quadrilateral meshes of bounded size. 55-98

Volume 15, Number 2, April 2005

• 
  Marina L. Gavrilova: Guest editors' foreword. 99-100
• 
  Godfried T. Toussaint: Geometric proximity graphs for improving nearest neighbor methods in instance-based learning and data mining. 101-150
• 
  Takeshi Kanda, Kokichi Sugihara: Two-dimensional range search based on the voronoi diagram. 151-166
• 
  Ferran Hurtado, Carlos Seara, Saurabh Sethia: Red-blue separability problems in 3D. 167-192
• 
  Sergey Bereg: An approximate morphing between polylines. 193-208
• 
  Donguk Kim, Deok-Soo Kim, Kokichi Sugihara: Euclidean voronoi diagram for circles in a circle. 209-228

Volume 15, Number 3, June 2005

• 
  Atsushi Kaneko, Mikio Kano: Semi-balanced Partitions of Two Sets of Points and Embeddings of Rooted Forests. 229-238
• 
  Danny Z. Chen, Michiel H. M. Smid, Bin Xu: Geometric Algorithms for Density-based Data Clustering. 239-260
• 
  Yu-Shin Chen, Der-Tsai Lee, Chung-Shou Liao: Labeling Points on a Single Line. 261-278
• 
  Hilderick A. van der Meiden, Willem F. Bronsvoort: An Efficient Method to Determine the Intended Solution for a System of Geometric Constraints. 279-298
• 
  Huawei Wang, Kaihuai Qin, Hanqiu Sun: Evaluation of Non-uniform Doo-sabin Surfaces. 299-324

Volume 15, Number 4, August 2005

• 
  Gill Barequet: Guest Editor's Foreword. 325-326
• 
  Ilya Baran, Erik D. Demaine: Optimal Adaptive Algorithms for Finding the nearest and Farthest Point on a Parametric Black-box Curve. 327-350
• 
  Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperin: Continuous Path Verification in Multi-axis Nc-machining. 351-378
• 
  Stefan Funke, Theocharis Malamatos, Rahul Ray: Finding Planar Regions in a Terrain - in Practice and with a Guarantee. 379-402
• 
  Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides: Separating Point Sets in Polygonal Environments. 403-420
• 
  Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Tathagata Ray: Quality Meshing of Polyhedra with Small Angles. 421-461

Volume 15, Number 5, October 2005

• 
  Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel: Maximizing a Voronoi Region: the Convex Case. 463-476
• 
  Abedallah Rababah: L-2 Degree Reduction of Triangular Bézier Surfaces with Common Tangent Planes at Vertices. 477-490
• 
  Sumanta Guha: Joint Separation of Geometric Clusters and the Extreme Irregularities of Regular Polyhedra. 491-510
• 
  Frédéric Cazals, Marc Pouget: Differential Topology and Geometry of Smooth Embedded Surfaces: Selected Topics. 511-536
• 
  Peter Braß, Mehrbod Sharifi: A Lower Bound for Lebesgue's Universal Cover Problem. 537-544

Volume 15, Number 6, December 2005

• 
  Henk Meijer, David Rappaport: Guest Editors' Foreword. 545-546
• 
  Daniel Archambault, William S. Evans, David G. Kirkpatrick: Computing the Set of all the Distant Horizons of a Terrain. 547-564
• 
  Sean M. Falconer, Bradford G. Nickerson: On Multi-level K-ranges for Range Search. 565-574
• 
  Gruia Calinescu, Adrian Dumitrescu, Howard J. Karloff, Peng-Jun Wan: Separating Points by Axis-parallel Lines. 575-590
• 
  Prosenjit Bose, Marc J. van Kreveld: Generalizing Monotonicity: on Recognizing Special Classes of Polygons and Polyhedra. 591-608
• 
  Amit M. Bhosle, Teofilo F. Gonzalez: Exact and Approximation Algorithms for Finding an Optimal Bridge Connecting Two Simple Polygons. 609-630

last updated on Sat May 18 06:12:29 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page