Session 1

• 
  Jirí Matousek: Construction of epsilon Nets. 1-10
• 
  Pankaj K. Agarwal: A Deterministic Algorithm for Partitioning Arrangements of Lines and Its Application. 11-22
• 
  Mike Paterson, F. Frances Yao: Binary Partitions with Applications to Hidden Surface Removal and Solid Modelling. 23-32
• 
  Ketan Mulmuley: A Fast Planar Partition Algorithm, II. 33-43
• 
  Peter W. Shor, Christopher J. Van Wyk: Detecting and Decomposing Self-Overlapping Curves. 44-50
• 
  Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis: Area Requirement and Symmetry Display in Drawing Graphs. 51-60
• 
  Gert Vegter: Kink-Free Deformations of Polygons. 61-68
• 
  Yan Ke: An Efficient Algorithm for Link-Distance Problems. 69-78

Session 2

• 
  Erich Kaltofen: Computing the Irreducible Real Factors and Components of an Algebraic Curve. 79-87
• 
  Shreeram S. Abhyankar, Srinivasan Chandrasekar, Vijaya Chandru: Degree Complexity Bounds on the Intersection of Algebraic Curves. 88-93
• 
  Chandrajit L. Bajaj, Insung Ihm: Hermite Interpolation of Rational Space Curves Using Real Algebraic Surfaces. 94-103
• 
  Mikhail J. Atallah, Jyh-Jong Tsay: On the Parallel Decomposability of Geometric Problems. 104-113
• 
  Mikhail J. Atallah, Danny Z. Chen: Optimal Parallel Algorithm for Visibility of a Simple Polygon from a Point. 114-123

Session 3

• 
  Jirí Matousek, Emo Welzl: Good Splitters for Counting Points in Triangles. 124-130
• 
  Bernard Chazelle, Burton Rosenberg: Computing Partial Sums in Multidimensional Arrays. 131-139
• 
  Imre Bárány, Zoltán Füredi, László Lovász: On the Number of Halving Planes. 140-144
• 
  Herbert Edelsbrunner: An Acyclicity Theorem for Cell Complexes in d Dimensions. 145-151
• 
  Richard Pollack, Rephael Wenger: Necessary and Sufficient Conditions for Hyperplane Transversals. 152-155

Session 4

• 
  Dan Halperin, Mark H. Overmars: Efficient Motion Planning for an L-Shaped Object. 156-166
• 
  L. Paul Chew, Klara Kedem: Placing the Largest Similar Copy of a Convex Polygon Among Polygonal Obstacles. 167-173
• 
  Joseph Friedman, John Hershberger, Jack Snoeyink: Compliant Motion in a Simple Polygon. 175-186
• 
  Amy J. Briggs: An Efficient Algorithm for One-Step Planar Complaint Motion Planning with Uncertainty. 187-196

Session 5

• 
  Victor Milenkovic: Calculating Approximate Curve Arrangements Using Rounded Arithmetic. 197-207
• 
  Keiko Imai, S. Sumino, Hiroshi Imai: Minimax Geometric Fitting of Two Corresponding Sets of Points. 206-275
• 
  David Salesin, Jorge Stolfi, Leonidas J. Guibas: Epsilon Geometry: Building Robust Algorithms from Imprecise Computations. 208-217
• 
  Erik Brisson: Representing Geometric Structures in d Dimensions: Topology and Order. 218-227
• 
  Pascal Lienhardt: Subdivisions of n-Dimensional Spaces and n-Dimensional Generalized Maps. 228-236
• 
  Jean-Daniel Boissonnat, Mariette Yvinec: Probing a Scene of Non Convex Polyhedra. 237-246
• 
  Binay K. Bhattacharya, David G. Kirkpatrick, Godfried T. Toussaint: Determining Sector Visibility of a Polygon. 247-253

Session 6

• 
  John Hershberger, Subhash Suri: Finding Tailored Partitions. 255-265
• 
  Jan-Ming Ho, D. T. Lee: Bounded Diameter Minimum Spanning Trees and Related Problems. 276-282
• 
  Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri: Fining k Points with Minimum Spanning Trees and Related Problems. 283-291
• 
  Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber: Fast Geometric Approximation Techniques and Geometric Embedding Problems. 292-301
• 
  Odile Marcotte, Subhash Suri: On Geometric Matching. 302-314
• 
  Pankaj K. Agarwal: Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number. 315-325
• 
  Rex A. Dwyer: Higher-Dimensional Voronoi Diagrams in Linear Expected Time. 326-333
• 
  Esther M. Arkin, Robert Connelly, Joseph S. B. Mitchell: On Monotone Paths Among Obstacles with Applications to Planning Assemblies. 334-343

Session 7

• 
  W. T. Liou, Jimmy J. M. Tan, Richard C. T. Lee: Minimum Partitioning Simple Rectilinear Polygons in o(n log log n) Time. 344-353
• 
  Jack Snoeyink, John Hershberger: Sweeping Arrangements of Curves. 354-363
• 
  Peter Egyed, Rephael Wenger: Stabbing Pairwise Disjoint Translates in Linear Time. 364-369
• 
  Joseph O'Rourke, Catherine A. Schevon: Computing the Geodesic Diameter of a 3-Polytope. 370-379
• 
  Jim Ruppert, Raimund Seidel: On the Difficulty of Tetrahedralizing 3-Dimensional Non-Convex Polyhedra. 380-392
• 
  Bernard Chazelle, Leonidas Palios: Triangulating a Non-Convex Polytype. 393-400

last updated on Tue May 21 01:55:20 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page