International Journal of Computational Geometry and Applications, Volume 7

Volume 7, Number 1/2, February/April 1997

• Esther M. Arkin, Joseph S. B. Mitchell, Steven Skiena: Guest Editors' Foreword. 1-
• Scott A. Mitchell: Finding a Covering Triangulation Whose Maximum Angle is Provably Small. 5-20
• Vadim Shapiro: Maintenance of Geometric Representations through Space Decompositions. 21-56
• Klara Kedem, Daniel Cohen-Or: Efficient Bitmap Resemblance Under Translations. 57-84
• Y. Ansel Teng, David M. Mount, Enrico Puppo, Larry S. Davis: Parallelizing and Algorithm for Visibility on Polyhedral Terrain. 75-84
• Yi-Jen Chiang, Roberto Tamassia: Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons Inside a Simple Polygonal Obstacle. 85-121
• Ming C. Lin, Dinesh Manocha: Efficient Contact Determination in Dynamic Environments. 123-151
• Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia: The Floodlight Problem. 153-163
• Joseph O'Rourke: Computational Geometry Column 30. 165-166

Volume 7, Number 3, June 1997

• Tamal K. Dey: Optimal Algorithms to Detect Null-Homologous Cycles on 2-Manifolds. 167-174
• Mark de Berg, Dan Halperin, Mark H. Overmars, Marc J. van Kreveld: Sparse Arrangements and the Number of Views of Polyhedral Scenes. 175-195
• Goos Kant: A More Compact Visibility Representation. 197-210
• Marek Chrobak, Goos Kant: Convex Grid Drawings of 3-Connected Planar Graphs. 211-223
• Susan Hert, Vladimir J. Lumelsky: Planar Curve Routing for Tethered-Robot Motion Planning. 225-252
• Binhai Zhu: Approximating Convex Polyhedra with Axis-Parallel Boxes. 253-267

Volume 7, Number 4, August 1997

• Steven Fortune: Editor's Foreword. 269-
• Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap: Approximate Euclidean Shortest Paths in 3-Space. 271-295
• Gautam Das, Giri Narasimhan: A Fast Algorithm for Constructing Sparse Euclidean Spanners. 297-315
• Joseph S. B. Mitchell, David M. Mount, Subhash Suri: Query-Sensitive Ray Shooting. 317-347
• Oswin Aichholzer, Helmut Alt, Günter Rote: Matching Shapes with a Reference Point. 349-363
• Herbert Edelsbrunner, Nimish R. Shah: Triangulating Topological Spaces. 365-378
• Joseph O'Rourke: Computational Geometry Column 31. 379-382
• Vadim Shapiro: Errata: Maintenance of Geometric Representations Through Space Decompositions. 383-

Volume 7, Number 5, October 1997

• Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki: Shortest Non-Crossing Rectilinear Paths in Plane Regions. 419-436
• Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta: The Rectangle Enclosure and Point-Dominance Problems Revisited. 437-455
• Joseph L. Ganley, James P. Cohoon: Improved Computation of Optimal Rectilinear Steiner Minimal Trees. 457-472
• J. Mark Keil: Covering Orthogonal Polygons with Non-Piercing Rectangles. 473-484
• David Eppstein: Faster Circle Packing with Application to Non-Obtuse Triangulation. 485-492
• Muhammad H. Alsuwaiyel: Two Algorithms for the Sum of Diameters Problem and a Related Problem. 493-508
• Joseph O'Rourke: Computational Geometry Column 32. 509-513

Volume 7, Number 6, December 1997

• Leizhen Cai, J. Mark Keil: Computing Visibility Information in an Inaccurate Simple Polygon. 515-538
• Vitit Kantabutra: Reaching a Point with an Unanchored Robot Arm in a Square. 539-550
• Jurek Czyzowicz, Hazel Everett, Jean-Marc Robert: Separating Translates in the Plane: Combinatorial Bounds and an Algorithm. 551-562
• Frank Follert, Elmar Schömer, Jürgen Sellen, Michiel H. M. Smid, Christian Thiel: Computing a Largest Empty Anchored Cylinder, and Related Problems. 563-580
• D. T. Lee, Chung-Do Yang, C. K. Wong: Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model. 581-598
• Wenping Wang, Barry Joe, Ronald N. Goldman: Rational Quadratic Parameterizations of Quadrics. 599-