Fast Industrial-Strength Triangulation
Edit Page
Report
Scan day: 17 February 2014 UTC
0
Virus safety - good
Description: By Martin Held. Copes with polygons with holes and degeneracies/self-intersections; based on repeatedly clipping ears. Source code on request.
CGA Lab (Director: Martin Held) - FIST: Fast Industrial-Strength Triangulation FIST: Fast Industrial-Strength Triangulation of Polygons The triangulation of a polygon is a basic building block for many graphics applications. For instance, high-speed rendering typically relies on polygonal and curved surfaces being subdivided into triangles that can be handled efficiently by the graphics hardware. Triangulating a polygon also is a fundamental operation in computational geometry, and it has received wide-spread interest over the last two decades. Through a series of improvements, the worst-case complexity of triangulating a polygon has been brought down to linear, achieved by Chazelle's seminal algorithm.
Size: 717 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | CGA Lab (Director: Martin Held) - FIST: Fast Industrial-Strength Triangulation |
| Keywords: | computational, geometry, algorithm, code, program, FIST, fist, tesselation, tesselator, triangulation, triangulator, polygon, polygonal, multiply-connected, segment, edge, triangle, hole, island, floating-point, reliable, efficient, fast, industrial-strength, robust |
| Description: | |
| IP-address: | 141.201.2.14 |