Journal: Int. J. Comput. Geometry Appl.

Volume 7, Issue 6

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

Volume 7, Issue 5

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

Volume 7, Issue 4

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

Volume 7, Issue 3

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

Volume 7, Issue 1/2

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