Martin Held. FIST: Fast industrial-strength triangulation of polygons. Algorithmica, 30(4):563--596, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Robust Geometric Computation - Yap (1997) (19 citations) (Correct)
....complexity (unlike GreeneYao) allow features to collapse (triangles can degenerate to a vertex) but disallow inversion (triangles cannot flip its orientation) 5. Give good bounds for the # # perturbation estimation problem. 6. Give a systematic treatment of inexact (dirty) data. Held [Hel01a, Hel01b] describes the engineering of reliable algorithms to handle such inputs. 41.7 SOURCES AND RELATED MATERIAL SURVEYS Forrest [For87] is an influential overview of the field of computational geometry. He deplores the gap between theory and practice and describes the open problem of robust ....
Martin Held. FIST: Fast industrial-strength triangulation of polygons. Algorithmica, 30(4):563--596, 2001.
Computing Voronoi Diagrams of Line Segments Reliably and Efficiently - Held (2000) Self-citation (Held) (Correct)
....is accompanied by several color plates available on the WWW. Point your browser to the WWW home page of vroni: www.cosy.sbg.ac.at held projects vroni vroni.html. This WWW page also provides a draft of the full version of this paper. 2 Survey of vroni The success of our triangulation code FIST [3, 4] motivated us to apply the same design principles to the computation of Voronoi diagrams of point sites and line segments. Its basic idea is to compute the Voronoi diagram such that 1. the correctness of each step can easily be monitored, 2. the correctness of the overall algorithm is a simple ....
....at the stage of desperate mode, we replace correct or optimum by best possible and neglect the numerical sanity checks, restricting our attention to the pure topology oriented approach. Desperate mode is a concept which we have successfully used in the triangulation code FIST, cf. [3, 4]. It is important to point out that vroni always rst attempts to perform a computation as it would normally perform it, irrelevant of whether or not it has already entered desperate mode once before. Anyway, even if the numerical sanity checks should fail continuously e.g. due to an ....
M. Held. FIST: Fast Industrial-Strength Triangulation of Polygons. Algorithmica, 2000. To appear.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC