Volume 7, 1997

• 
  Chee-Keng Yap: Towards Exact Geometric Computation. 3-23
• 
  Victor J. Milenkovic, Veljko Milenkovic: Rational Orthogonal Approximations to Orthogonal Matrices. 25-35
• 
  Gautam Das, Paul J. Heffernan, Giri Narasimhan: LR-visibility in Polygons. 37-57
• 
  Jean-Marc Robert: Geometric Orderings of Intersecting Translates and Their Applications. 59-72
• 
  L. Paul Chew: Near-quadratic Bounds for the L1Voronoi Diagram of Moving Points. 73-80
• 
  Mark de Berg, Marko de Groot, Mark H. Overmars: Perfect Binary Space Partitions. 81-91
• 
  Scott A. Mitchell: Approximating the Maxmin-angle Covering Triangulation. 93-111
• 
  L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets: Geometric Pattern Matching Under Euclidean Motion. 113-124
• 
  Karen L. Daniels, Victor J. Milenkovic, Dan Roth: Finding the Largest Area Axis-parallel Rectangle in a Polygon. 125-148
• 
  John Hershberger, Subhash Suri: Finding a Shortest Diagonal of a Simple Polygon in Linear Time. 149-160
• 
  Paul Colley, Anna Lubiw, Jeremy Spinrad: Visibility Graphs of Towers. 161-172
• 
  Prosenjit Bose, Thomas C. Shermer, Godfried T. Toussaint, Binhai Zhu: Guarding Polyhedral Terrains. 173-185
• 
  Paul Fischer: Sequential and Parallel Algorithms for Finding a Maximum Convex Polygon. 187-200
• 
  Hazel Everett, Eduardo Rivera-Campo: Edge Guarding Polyhedral Terrains. 201-203
• 
  Paul Erdös, Peter C. Fishburn: Minimum Planar Sets with Maximum Equidistance Counts. 207-218
• 
  Mujtaba R. Ghouse, Michael T. Goodrich: Fast Randomized Parallel Methods for Planar Convex Hull Construction. 219-235
• 
  Daniel Q. Naiman, Henry P. Wynn: On Intersecting a Point Set with Euclidean Balls. 237-244
• 
  Sabine Stifter: Characterization of Contour Elements That Generate Abstract Voronoi Diagrams. 245-262
• 
  David Avis, David Bremner, Raimund Seidel: How Good Are Convex Hull Algorithms?. 265-301
• 
  Emo Welzl, Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu: An Experimental Comparison of Four Graph Drawing Algorithms. 303-325
• 
  Bernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal: Strategies for Polyhedral Surface Decomposition: an Experimental Study. 327-342
• 
  Emo Welzl, Herbert Edelsbrunner, Roman Waupotitsch: A Combinatorial Approach to Cartograms. 343-360
• 
  Emo Welzl, Peter Su, Robert L. (Scot) Drysdale III: A Comparison of Sequential Delaunay Triangulation Algorithms. 361-385
• 
  Frank Wagner, Alexander Wolff: A Practical Map Labeling Algorithm. 387-404

last updated on Mon May 20 02:56:09 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page