An algorithm for constructing the union, intersection and difference of
arbitrary polygons on the basis of triangulation with linear-time complexity on average
Abstract:
The application of triangulation with constraints for constructing overlays
of arbitrary polygons is considered. A comparison of a new algorithm with
some others is given.
Keywords:triangulation, computational geometry, computer graphycs, grid construction, data structure.
Fulltext:
PDF file (200 kB)