Optimal Polygon Triangulation

Optimal Polygon Triangulation is a computational geometry method that belongs to the class of polygon triangulation techniques, distinguished by its objective of decomposing a polygon into triangles such that a specified optimality criterion—such as minimal total edge weight or minimal maximum angle—is achieved.

9

Publications

306

Citations

14

Authors

8

Institutions

Publications per year

2017–2026

0

Authors

14

  1. HL
    Hongfei Liu

    University of Houston, United States

    2 publications · 48 citations

    2

    h-index

  2. GB
    Gill Barequet

    Technion – Israel Institute of Technology, Israel

    2 publications · 177 citations

    2

    h-index

  3. SS
    Shou‐Hsuan Stephen Huang

    University of Houston, United States

    2 publications · 48 citations

    2

    h-index

  4. MS
    Micha Sharir

    Tel Aviv University, Israel

    2 publications · 177 citations

    2

    h-index

  5. KN
    Koji Nakano

    Hiroshima University, Japan

    2 publications · 30 citations

    2

    h-index

1–5 of 14

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 1 publications · 36 citations

    1

    h-index

  2. Computer Vision and Image Understanding

    CVIU · 1 publications · 137 citations

    1

    h-index

  3. SIAM Journal on Computing

    1 publications · 16 citations

    1

    h-index

  4. IEICE Transactions on Information and Systems

    1 publications · 18 citations

    1

    h-index

  5. Computational Geometry

    1 publications · 23 citations

    1

    h-index

1–5