Description: HGRD is a code for triangulation of a polygon with or without holes. It can triangulate and also deal with many disconnected polygons treated as a single one [see figure with the triangulation of Norway border line]. The algorithm is based on Delaunay triangulation. One of the main problems was to keep complexity order as low as possible [N log N] so tree structures [i.e., STL map] are used in critical parts. Thanks to this, it was possible to triangulate a complex polygon with around 40000 nodes within 6s [Athlon 1.4GHz DDR 266].
File list (Check if you may need any files):
hgrd_src_zdhdhth
................\hgrd
................\....\data
................\....\....\simple_poly.pnt
................\....\makefile
................\....\readme
................\....\src
................\....\...\dimension.cxx
................\....\...\dimension.h
................\....\...\hgrid.cxx
................\....\...\hgrid.h
................\....\...\hpolygon.cxx
................\....\...\hpolygon.h
................\....\...\hrect.h
................\....\...\main.cxx
................\....\...\mgconst.cxx
................\....\...\mgconst.h
................\....\...\mgdecl.h
................\....\...\mgexcept.cxx
................\....\...\mgexcept.h
................\....\...\stldecl.h
................\....\...\vect.h
Download