4. Symposium on Computational Geometry 1988: Urbana-Champaign, IL, USA

• Kenneth L. Clarkson:
  Applications of Random Sampling in Computational Geometry, II. 1-11
  
• Kenneth L. Clarkson, Peter W. Shor:
  Algorithms for Diametral Pairs and Convex Hulls That Are Optimal, Randomized, and Incremental. 12-17
  
• Kenneth L. Clarkson, Robert Endre Tarjan, Christopher J. Van Wyk:
  A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. 18-22
  
• Emo Welzl:
  Partition Trees for Triangle Counting and Other Range Searching Problems. 23-33
  
• Dan E. Willard, Young C. Wee:
  Quasi-Valid Range Querying and Its Implications for Nearest Neighbor Problems. 34-43
  
• Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
  The Complexity of Many Faces in Arrangements of Lines of Segments. 44-55
  
• Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl:
  Implicitly Representing Arrangements of Lines or Segments. 56-69
  
• Pankaj K. Agarwal, Micha Sharir:
  Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection. 70-80
  
• Bruno Buchberger:
  Algebraic Methods for Non-Linear Computational Geometry (Invited Address). 81-82
  
• L. W. Ericson, Chee-Keng Yap:
  The Design of LINETOOL, a Geometric Editor. 83-92
  
• David P. Dobkin, Deborah Silver:
  Recipes for Geometry and Numerical Analysis - Part I: An Empirical Study. 93-105
  
• Christoph M. Hoffmann, John E. Hopcroft, Michael S. Karasick:
  Towards Implementing Robust Geometric Computations. 106-117
  
• Herbert Edelsbrunner, Ernst P. Mücke:
  Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms. 118-133
  
• Chee-Keng Yap:
  A Geometric Consistency Theorem for a Symbolic Perturbation Scheme. 134-142
  
• David M. Mount, Alan Saalfeld:
  Globally-Equiangular Triangulations of Co-Circular Points in 0(n log n) Time. 143-152
  
• Mordecai J. Golin, Robert Sedgewick:
  Analysis of a Simple Yet Efficient Convex Hull Algorithm. 153-163
  
• Mark H. Overmars, Emo Welzl:
  New Methods for Computing Visibility Graphs. 164-171
  
• Sanjiv Kapoor, S. N. Maheshwari:
  Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles. 172-182
  
• Marshall W. Bern:
  Hidden Surface Removal for Rectangles. 183-192
  
• John H. Reif, Sandeep Sen:
  An Efficient Output-Sensitive Hidden Surface Removal Algorithm and Its Parallelization. 193-200
  
• Richard Cole, Michael T. Goodrich:
  Optimal Parallel Algorithms for Polygon and Point-Set Problems. 201-210
  
• Rajeev Motwani, Arvind Raghunathan, Huzur Saran:
  Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach. 211-223
  
• David P. Dobkin, Herbert Edelsbrunner, Mark H. Overmars:
  Searching for Empty Convex Polygons. 224-228
  
• Boris Aronov, Steven Fortune, Gordon T. Wilfong:
  The Furthest-Site Geodesic Voronoi Diagram. 229-240
  
• Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao:
  Computing Euclidean Maximum Spanning Trees. 241-251
  
• Tetsuo Asano, Binay K. Bhattacharya, J. Mark Keil, F. Frances Yao:
  Clustering Algorithms Based on Minimum and Maximum Spanning Trees. 252-257
  
• Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink:
  On Arrangements of Jordan Arcs with Three Intersections per Pair. 258-265
  
• Laxmi Gewali, Alex C. Meng, Joseph S. B. Mitchell, Simeon C. Ntafos:
  Path Planning in 0/1/infinity Weighted Regions with Applications. 266-278
  
• Gordon T. Wilfong:
  Motion Planning in the Presence of Movable Obstacles. 279-288
  
• Leonidas J. Guibas, Micha Sharir, Shmuel Sifrony:
  On the General Motion Planning Problem with Two Degrees of Freedom. 289-298
  
• B. K. Natarajan:
  On Planning Assemblies. 299-308
  
• Bruce Randall Donald:
  The Complexity of Planar Compliant Motion Planning Under Uncertainty. 309-318
  
• Micha Sharir, Shmuel Sifrony:
  Coordinated Motion Planning for Two Independent Robots. 319-328
  
• Klara Kedem, Micha Sharir:
  An Automatic Motion Planning System for a Convex Polygonal Mobile Robot in 2-Dimensional Polygonal Space. 329-340
  
• Joseph S. B. Mitchell:
  On Maximum Flows in Polyhedral Domains. 341-351
  
• Peter Yamamoto, Kenji Kato, Keiko Imai, Hiroshi Imai:
  Algorithms for Vertical and Orthogonal L1 Linear Approximation of Points. 352-361
  
• Jerzy W. Jaromczyk, Miroslaw Kowaluk:
  Skewed Projections with an Application to Line Stabbing in R3. 362-370
  
• M. McKenna, Joseph O'Rourke:
  Arrangements of Lines in 3-Space: A Data Structure with Applications. 371-380
  
• Boris Aronov, Micha Sharir:
  Triangles in Space or Building (and Analyzing) Castles in the Air. 381-391
  
• Shaodi Gao, Mark Jerrum, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling:
  On Continuous Homotopic One Layer Routing. 392-402
  

Last update Tue May 22 04:49:27 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page