Volume 9, Number 1, February 1999

• 
  Sándor P. Fekete, Henk Meijer: Rectangle and Box Visibility Graphs in 3D. 1-28
• 
  Mikhail J. Atallah: An Improved Hypercube Bound for Multisearching and Its Applications. 29-38
• 
  Olivier Devillers, Matthew J. Katz: Optimal Line Bipartitions of Point Sets. 39-51
• 
  David G. Kirkpatrick, Jack Snoeyink: Computing Constrained Shortest Segments: Butterfly Wingspans in Logarithmic Time. 53-62
• 
  Xuehou Tan: Edge Guards in Straight Walkable Polygons. 63-80
• 
  Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint: Computing a Shortest Weakly Externally Visible Line Segment for a Simple Polygon. 81-96
• 
  Michiel H. M. Smid, Ravi Janardan: On the width and roundness of a set of points in the plane. 97-108

Volume 9, Number 2, April 1999

• 
  Alex Glozman, Klara Kedem, Gregory Shpitalnik: Computing a double-ray center for a planar point set. 109-123
• 
  Vadim Shapiro: Well-Formed Set Representations of Solids. 125-150
• 
  Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki: A Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. 151-170
• 
  Evangelos Kranakis, Jorge Urrutia: Isomorphic Triangulations with Small Number of Steiner Points. 171-180
• 
  Jurek Czyzowicz, Ivan Stojmenovic, Jorge Urrutia: Immobilizing a Shape. 181-206
• 
  Edward F. Grove, T. M. Murali, Jeffrey Scott Vitter: The Object Complexity Model for Hidden-Surface Removal. 207-217

Volume 9, Number 3, June 1999

• 
  Michael Segal: On Piercing Sets of Axis-Parallel Rectangles and Rings. 219-234
• 
  Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Evanthia Papadopoulou: Skew Voronoi Diagrams. 235-248
• 
  Eyal Assa, Matthew J. Katz: 3-Piercing of d-Dimensional Boxes and Homothetic Triangles. 249-260
• 
  Giri Narasimhan: On Hamiltonian Triangulations in Simple Polygons. 261-275
• 
  Dana S. Richards, Jeffrey S. Salowe: Mixed Spanning Trees in Theory and Practice. 277-292
• 
  Nakhoon Baek, Sung Yong Shin, Kyung-Yong Chwa: On Computing Translational Swept Volumes. 293-317
• 
  Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki: Corrigendum to ``An Incremental Algorithm for Constructing Shortest Watchman Routes''. 319-323

Volume 9, Number 4/5, August/October 1999

• 
  Pankaj K. Agarwal: Guest Editor's Foreword. 325-326
• 
  Fausto Bernardini, Chandrajit L. Bajaj, Jindong Chen, Daniel Schikore: Automatic Reconstruction of 3D CAD Models from Digital Scans. 327-369
• 
  Michael H. Goldwasser, Rajeev Motwani: Complexity Measures for Assembly Sequences. 371-418
• 
  Stina S. Bridgeman, Ashim Garg, Roberto Tamassia: A Graph Drawing and Translation Service on the World Wide Web. 419-446
• 
  Howie Choset: Nonsmooth Analysis, Convex Analysis, and their Applications to Motion Planning. 447-470
• 
  Leonidas J. Guibas, Jean-Claude Latombe, Steven M. LaValle, David Lin, Rajeev Motwani: A Visibility-Based Pursuit-Evasion Problem. 471-494
• 
  David Hsu, Jean-Claude Latombe, Rajeev Motwani: Path Planning in Expansive Configuration Spaces. 495-512
• 
  Joseph O'Rourke: Computational Geometry Column 35. 513-516

Volume 9, Number 6, December 1999

• 
  Marshall W. Bern, David Eppstein, Shang-Hua Teng: Parallel Construction of Quadtrees and Quality Triangulations. 517-532
• 
  Evanthia Papadopoulou: k-Pairs Non-Crossing Shortest Paths in a Simple Polygon. 533-552
• 
  Fabrizio d'Amore, Roberto Giaccio: Intersection Problems on Segments Under Boundary Updates with Application to Persistent Lists. 553-576
• 
  Gary L. Miller, Dafna Talmor, Shang-Hua Teng: Data Generation for Geometric Algorithms on Non-Uniform Distributions. 577-598
• 
  Horst Martini, Valeriu Soltan: Minimum Number of Pieces in a Convex Partition of a Polygonal Domain. 599-614
• 
  Joseph O'Rourke: Computational Geometry Column 36. 615-618

last updated on Thu May 23 04:16:37 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page