Computational geometry: an introduction
Computational geometry: an introduction
SIAM Journal on Numerical Analysis
Algorithm 752: SRFPACK: software for scattered data fitting with a constrained surface under tension
ACM Transactions on Mathematical Software (TOMS)
Algorithm 761: Scattered-data surface fitting that has the accuracy of a cubic polynomial
ACM Transactions on Mathematical Software (TOMS)
Algorithm 772: STRIPACK: Delaunay triangulation and Voronoi diagram on the surface of a sphere
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
Algorithm 792: accuracy test of ACM algorithms for interpolation of scattered data in the plane
ACM Transactions on Mathematical Software (TOMS)
| Hi-index | 0.00 |
TRIPACK is a Fortran 77 software package that employs an incremental algorithm to construct a constrained Delaunay traingulation of a set of points in the plane (nodes). The triangulation covers the convex hull of the nodes but may include polygonal constraint regions whose triangles are distinguishable from those in the remainder of the triangulation. This effectively allows for a nonconvex or multiply connected triangulation (the complement of the union of constraint regions) while retaining the efficiency of searching and updating a convex triangulation. The package provides a wide range of capabilities including an efficient means of updating the triangulation with nodal additions or deletions. For N nodes, the storage requirement is 13N integer storage locations in addition to the 2N nodal coordinates.