WACG 1996: Philadelphia, PA, USA

@proceedings{DBLP:conf/wacg/1996,
  editor    = {Ming C. Lin and
               Dinesh Manocha},
  title     = {Applied Computational Geormetry, Towards Geometric Engineering,
               FCRC'96 Workshop, WACG'96, Philadelphia, PA, May 27-28, 1996,
               Selected Papers},
  booktitle = {WACG},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1148},
  year      = {1996},
  isbn      = {3-540-61785-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Contributions

• Christoph M. Hoffmann:
  How Solid is Solid Modeling? 1-8
  
• Steven Fortune:
  Robustness Issues in Geometric Algorithms. 9-14
  
• Leonidas J. Guibas:
  Implementing Geometric Algorithms Robustly. 15-22
  
• Franco P. Preparata:
  Robustness in Geometric Algorithms. 23-24
  
• Michael J. Pratt:
  Applications of Computational Geometry in Mechanical Engineering Design and Manufacture. 25-36
  
• Joseph S. B. Mitchell:
  On Some Applications of Computational Geometry in Manufacturing and Virtual Environments. 37-40
  
• David P. Dobkin:
  Visualizing Geometric Algorithms - State of the Art. 41-44
  
• D. T. Lee:
  Geometric Algorithm Visualization, Current Status and Future. 45-50
  
• Kurt Mehlhorn:
  Position Paper for Panel Discussion. 51-52
  
• Mark H. Overmars:
  Designing the Computational Geometry Algorithms Library CGAL. 53-58
  
• Bernard Chazelle:
  The Computational Geometry Impact Task Force Report: An Executive Summary. 59-65
  

Submitted Contributions

• Paul W. Finn, Dan Halperin, Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Christian R. Shelton, Suresh Venkatasubramanian:
  Geometric Manipulation of Flexible Ligands. 67-78
  
• Michael G. Prisant:
  Ray-Representation Formalism for Geometric Computations. 79-90
  
• Karen L. Daniels, Victor Milenkovic:
  Column-Based Strip Packing Using Ordered and Compliant Containment. 91-107
  
• Jayanth Majhi, Prosenjit Gupta, Ravi Janardan:
  Computing a Flattest, Undercut-Free Parting Line for a Convex Polyhedron, with Application to Mold Design. 109-120
  
• David P. Dobkin, Dimitrios Gunopulos:
  Geometric Problems in Machine Learning. 121-132
  
• Ronen Basri, David W. Jacobs:
  Matching Convex Polygons and Polyhedra, Allowing for Occlusion. 133-147
  
• Chao-Kuei Hung, Doug Ierardi:
  Stably Placing Piecewise Smooth Objects. 149-156
  
• Steven Fortune:
  A Beam-Tracing Algorithm for Prediction of Indoor Radio Propagation. 157-166
  
• Brian W. Kernighan, Christopher J. Van Wyk:
  Extracting Geometric Information form Architectural Drawings. 167-176
  
• Rachel Orti, Frédo Durand, Stéphane Rivière, Claude Puech:
  Using the Visibility Complex for Radiosity Computation. 177-190
  
• Andreas Fabri, Geert-Jan Giezeman, Lutz Kettner, Stefan Schirra, Sven Schönherr:
  The CGAL Kernel: A Basis for Geometric Computation. 191-202
  
• Jonathan Richard Shewchuk:
  Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator. 203-222
  

Last update Mon Feb 13 04:42:56 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page