Journal: Algorithmica

Volume 8, Issue 5&6

343 -- 344Mikhail J. Atallah. Editor s Foreword: Special Issue on the Sixth Annual Symposium on Computational Geometry
345 -- 364Zhenyu Li, Victor Milenkovic. Constructing Strongly Convex Hulls Using Exact or Rounded Arithmetic
365 -- 389Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap. Simultaneous Inner and Outer Approximation of Shapes
391 -- 406Helmut Alt, Rudolf Fleischer, Michael Kaufmann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig. Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
407 -- 429Bernard Chazelle, Micha Sharir, Emo Welzl. Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems
431 -- 459Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger. Minimum-Link Paths Among Obstacles in the Plan
461 -- 486Michael T. Goodrich, Steven B. Shauck, Sumanta Guha. Parallel Methods for Visibility and Shortest-Path Problems in Simple Polygons

Volume 8, Issue 4

257 -- 283Franco P. Preparata, Jeffrey Scott Vitter, Mariette Yvinec. Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds
285 -- 319Alberto Apostolico. Optimal Parallel Detection of Squares in Strings
321 -- 342Jean-Daniel Boissonnat, Mariette Yvinec. Probing a Scene of Nonconvex Polyhedra

Volume 8, Issue 3

177 -- 194Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee. Solving the Euclidean Bottleneck Matching Problem by k-Relative Neighborhood Graphs
195 -- 208Amy J. Briggs. An Efficient Algorithm for One-Step Planar Compliant Motion Planning with Uncertainty
209 -- 231Mikhail J. Atallah, Jyh-Jong Tsay. On the Parallel-Decomposability of Geometric Problems
233 -- 249Chung-Kuan Cheng, T. C. Hu. Maximum Concurrent Flows and Minimum Cuts
251 -- 256Christos Levcopoulos, Andrzej Lingas. There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees

Volume 8, Issue 2

89 -- 101Sun Wu, Udi Manber. Path-Matching Problems
103 -- 117Dan Gusfield, Leonard Pitt. A Bounded Approximation for the Minimum Cost 2-Sat Problem
119 -- 144Christine Rüb. Line-Segment Intersection Reporting in Parallel
145 -- 160Donald Goldfarb, Jianxiu Hao. Polynomial-Time Primal Simplex Algorithms for the Minimum Cost Network Flow Problem
161 -- 176Ilan Adler, Renato D. C. Monteiro. A Geometric View of Parametric Linear Programming

Volume 8, Issue 1

1 -- 20Jacob T. Schwartz, Micha Sharir. Finding Effective Force Targets for Two-Dimensional Multifinger Frictional Grips
21 -- 38Sanguthevar Rajasekaran, Thanasis Tsantilas. Optimal Routing Algorithms for Mesh-Connected Processor Arrays
39 -- 54Robert E. Webber, Hanan Samet. Linear-Time Border-Tracing Algorithms for Quadtrees
55 -- 88Joseph S. B. Mitchell. L_1 Shortest Paths Among Polygonal Obstacles in the Plane