Largest subsets of triangles in a triangulation

Boris Aronov, Marc Van Kreveld, Maarten Löffler, Rodrigo I. Silveira

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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 languageEnglish (US)
    Title of host publicationCCCG 2007 - 19th Canadian Conference on Computational Geometry
    Pages213-216
    Number of pages4
    StatePublished - 2007
    Event19th Annual Canadian Conference on Computational Geometry, CCCG 2007 - Ottawa, ON, Canada
    Duration: Aug 20 2007Aug 22 2007

    Other

    Other19th Annual Canadian Conference on Computational Geometry, CCCG 2007
    CountryCanada
    CityOttawa, ON
    Period8/20/078/22/07

    Fingerprint

    Triangulation
    Triangle
    Subset
    Connected Set
    Monotone
    Polynomial time
    NP-complete problem
    Angle
    Computing

    ASJC Scopus subject areas

    • Geometry and Topology

    Cite this

    Aronov, B., Van Kreveld, M., Löffler, M., & Silveira, R. I. (2007). Largest subsets of triangles in a triangulation. In 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.

    CCCG 2007 - 19th Canadian Conference on Computational Geometry. 2007. p. 213-216.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Aronov, B, Van Kreveld, M, Löffler, M & Silveira, RI 2007, Largest subsets of triangles in a triangulation. in 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.
    Aronov B, Van Kreveld M, Löffler M, Silveira RI. Largest subsets of triangles in a triangulation. In CCCG 2007 - 19th Canadian Conference on Computational Geometry. 2007. p. 213-216
    Aronov, Boris ; Van Kreveld, Marc ; Löffler, Maarten ; Silveira, Rodrigo I. / Largest subsets of triangles in a triangulation. CCCG 2007 - 19th Canadian Conference on Computational Geometry. 2007. pp. 213-216
    @inproceedings{8c160577ebd3400db7807cbd18964c28,
    title = "Largest subsets of triangles in a triangulation",
    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.",
    author = "Boris Aronov and {Van Kreveld}, Marc and Maarten L{\"o}ffler and Silveira, {Rodrigo I.}",
    year = "2007",
    language = "English (US)",
    pages = "213--216",
    booktitle = "CCCG 2007 - 19th Canadian Conference on Computational Geometry",

    }

    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 -