Largest Subsets of Triangles in a Triangulation

Given a triangulation of n points, with some triangles marked “good”, this paper discusses the problems of computing the largest-area connected set of good triangles that (i) is convex, (ii) is monotone, (iii) has a bounded total angular change, or (iv) has a bounded negative turning angle. The first, second, and fourth problems are solved in polynomial time, the third problem is NP-hard.

• Type: Conference
• Year: 2007
• Where: CCCG
• Authors: Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira
• Keywords: CCCG 2007, Computational Geometry, Largest-area Connected Set, Negative Turning Angle, Total Angular Change