research

Subquadratic nonobtuse triangulation of convex polygons

Authors
Publication date
15 July 1991
Publisher
eScholarship, University of California

Abstract

A convex polygon with n sides can be triangulated by O(n^1.85) triangles, without any obtuse angles. The construction uses a novel form of geometric divide and conquer

    Similar works

    Full text

    thumbnail-image

    Available Versions

    Sustaining member

    eScholarship - University of California

    redirect
    oaioai:escholarship.org:ark:/1303...
    Last time updated on 25/12/2021