Polygon Partitioning

Polygon Partitioning is a computational geometry method that decomposes a polygon into a set of simpler, non-overlapping sub-polygons such that their union equals the original polygon, typically to facilitate efficient algorithmic processing in spatial reasoning tasks.

61

Publications

2.7K

Citations

115

Authors

76

Institutions

Publications per year

2017–2026

5

Authors

115

  1. BC
    Bernard Chazelle

    Princeton University, United States

    2 publications · 380 citations

    2

    h-index

  2. MV
    Marc van Kreveld

    Utrecht University, Netherlands

    2 publications · 101 citations

    2

    h-index

  3. KS
    Kenichi Sugihara

    Gifu Kyoritsu University, Japan

    2 publications · 39 citations

    2

    h-index

  4. GT
    Godfried T. Toussaint

    McGill University, Canada

    2 publications · 118 citations

    2

    h-index

  5. SS
    Sartaj Sahni

    University of Florida, United States

    2 publications · 65 citations

    2

    h-index

1–5 of 115

Venues

  1. Computational Geometry

    4 publications · 122 citations

    4

    h-index

  2. 2

    h-index

  3. Discrete Applied Mathematics

    2 publications · 52 citations

    2

    h-index

  4. Discrete Mathematics

    2 publications · 31 citations

    2

    h-index

  5. 2

    h-index

1–5