|
Fast Industrial-Strength Triangulation (FIST)

Library Home ||
Full Table of Contents ||
Suggest a Link ||
Library Help

| http://www.cosy.sbg.ac.at/~held/projects/triang/triang.html | |
|
|
|
| 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. | |
|
|
|
| Levels: | College |
| Languages: | English |
| Resource Types: | Topic Tools Miscellaneous |
| Math Topics: | Computational Geometry |
[Privacy Policy] [Terms of Use]


© 1994-2012 Drexel University. All rights reserved.
http://mathforum.org/
The Math Forum is a research and educational enterprise of the Goodwin College of Professional Studies.