This anthology is based on the First ACM Workshop on Applied Computational Geometry, WACG '96, held in Philadelphia, PA, USA, in May 1996, as part of the FCRC Conference.
Today, CG is in transition and applied computational geometry has established itself as a fertile meeting ground for theorists from core computational geometry and practitioners from the potential application areas to exchange their ideas and identify issues of common interest. The book presents 11 invited contributions and state-of-the-art reports by leading experts together with 12 refereed full papers selected from 32 submissions. It points the way towards geometrical engineering and addresses researchers and professionals sharing an interest in geometric algorithms and techniques and their use in computational sciences and engineering.
Author(s): Christoph M. Hoffmann (auth.), Ming C. Lin, Dinesh Manocha (eds.)
Series: Lecture Notes in Computer Science 1148
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1996
Language: English
Pages: 222
Tags: Computer Graphics; Computer-Aided Engineering (CAD, CAE) and Design; Visualization
How solid is solid modeling?....Pages 1-8
Robustness issues in geometric algorithms....Pages 9-14
Implementing geometric algorithms robustly....Pages 15-22
Robustness in geometric algorithms....Pages 23-24
Applications of computational geometry in mechanical engineering design and manufacture....Pages 25-36
On some applications of computational geometry in manufacturing and virtual environments....Pages 37-40
Visualizing geometric algorithms — State of the art....Pages 41-44
Geometric algorithm visualization, current status and future....Pages 45-50
Position paper for panel discussion....Pages 51-52
Designing the computational geometry algorithms library CGAL....Pages 53-58
The computational geometry impact task force report: An executive summary....Pages 59-65
Geometric manipulation of flexible ligands....Pages 67-78
Ray-representation formalism for geometric computations on protein solid models....Pages 79-90
Column-based strip packing using ordered and compliant containment....Pages 91-107
Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design....Pages 109-120
Geometric problems in machine learning....Pages 121-132
Matching convex polygons and polyhedra, allowing for occlusion....Pages 133-147
Stably placing piecewise smooth objects....Pages 149-156
A beam-tracing algorithm for prediction of indoor radio propagation....Pages 157-166
Extracting geometric information from architectural drawings....Pages 167-176
Using the visibility complex for radiosity computation....Pages 177-190
The CGAL kernel: A basis for geometric computation....Pages 191-202
Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator....Pages 203-222
