Numerical Accuracy and Consistent Topology in Geometric Computations
by
Thomas J. Peters
University of Connecticut
Coauthors: D. R. Ferguson (The Boeing Company), C. Mow (University of Connecticut), N. F. Stewart (University of Montreal)

Several contemporary authors have shown that tractable algorithms are unlikely to exist for creating computational representations of geometric models that satisfy typically assumed topological constraints. However, these negative results leave open the question of whether acceptable approximation approaches can be found, as has been done with approximation algorithms for the traveling salesman problem, which is NP-hard. A central tool in building computational representations of geometric models is a surface intersection algorithm. The speaker will present new results, both theoretical and experimental, on surface intersection approximation algorithms. The work presented has been joint with D. R. Ferguson, C. Mow and N. F. Stewart.

Date received: July 3, 2001

Copyright © 2001 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cahy-06.