Fast Industrial-Strength Triangulation (FIST)
Library Home || Full Table of Contents || Suggest a Link || Library Help
|Martin Held; Institute of Computer Science, University of Salzburg|
|FIST is code for fast industrial-strength triangulation based on repeatedly clipping the ears of a polygon. The algorithm was implemented in ANSI C, based on floating-point arithmetic. Geometric hashing is used in order to speed up the ear-clipping process in practice. Illustrations show triangulations computed by means of FIST. With related publications.|
|Resource Types:||Topic Tools Miscellaneous|
|Math Topics:||Computational Geometry|
© 1994- Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.