Homepage of T.R. Mezei
Homepage of T.R. Mezei
Home
Projects
Publications
Talks
Experience & Contests
Posts
Contact
CV
Light
Dark
Automatic
orthogonal polygon
Partitioning orthogonal polygons into at most 8-vertex pieces, with application to an art gallery theorem
We prove that every simply connected orthogonal polygon of $n$ vertices can be partitioned into $\lfloor\frac{3n+4}{16}\rfloor$ (simply connected) orthogonal polygons of at most 8 vertices. It yields a new and shorter proof of the theorem of A. …
Cite
×