### Abstract

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.

Original language | English (US) |
---|---|

Title of host publication | CCCG 2007 - 19th Canadian Conference on Computational Geometry |

Pages | 213-216 |

Number of pages | 4 |

State | Published - 2007 |

Event | 19th Annual Canadian Conference on Computational Geometry, CCCG 2007 - Ottawa, ON, Canada Duration: Aug 20 2007 → Aug 22 2007 |

### Other

Other | 19th Annual Canadian Conference on Computational Geometry, CCCG 2007 |
---|---|

Country | Canada |

City | Ottawa, ON |

Period | 8/20/07 → 8/22/07 |

### Fingerprint

### ASJC Scopus subject areas

- Geometry and Topology

### Cite this

*CCCG 2007 - 19th Canadian Conference on Computational Geometry*(pp. 213-216)

**Largest subsets of triangles in a triangulation.** / Aronov, Boris; Van Kreveld, Marc; Löffler, Maarten; Silveira, Rodrigo I.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*CCCG 2007 - 19th Canadian Conference on Computational Geometry.*pp. 213-216, 19th Annual Canadian Conference on Computational Geometry, CCCG 2007, Ottawa, ON, Canada, 8/20/07.

}

TY - GEN

T1 - Largest subsets of triangles in a triangulation

AU - Aronov, Boris

AU - Van Kreveld, Marc

AU - Löffler, Maarten

AU - Silveira, Rodrigo I.

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84893343861&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84893343861&partnerID=8YFLogxK

M3 - Conference contribution

SP - 213

EP - 216

BT - CCCG 2007 - 19th Canadian Conference on Computational Geometry

ER -