Section: Highlights of the Year
Highlights of the Year
Given a set of possibly intersecting polygons in 3D, we presented a breakthrough result on the problem of computing a set of interior-disjoint triangles whose geometry is close to that of the input and such that the output vertices have coordinates of fixed precision, typically integers or floating-point numbers of bounded precision (eg. int, float, double). This problem is important in academic and industrial contexts because many 3D digital models contain self intersections and many applications require models without self intersections. Despite the theoretical and practical relevance of this problem, there was almost no literature on the subject and we presented its first satisfactory solution .