A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
3-Colored Triangulation of 2D Maps
International journal of computational geometry and applications
We describe an algorithm to triangulate a general map on an arbitrary surface in such way that the resulting triangulation is vertex-colorable with three colors. (Threecolorable triangulations can be efficiently represented and manipulated by the GEM data structure of Montagner and Stolfi.) The standard solution to this problem is the barycentric subdivision, which produces 4e − 2b triangles when applied to a map with e edges, such that b of them are border edges (adjacent to only one face).doi:10.1142/s0218195916500060 fatcat:4dhlyj4cqjaplfw33mng35srwy