Area-Optimal Simple Polygonalizations: The CG Challenge 2019
Main Authors: | Demaine, Erik, Fekete, S?ndor, Keldenich, Phillip, Krupke, Dominik, Mitchell, Joseph |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
ACM
2022
|
Online Access: | https://hdl.handle.net/1721.1/146480 |
Similar Items
-
Making polygons by simple folds and one straight cut
by: Demaine, Erik D., et al.
Published: (2012) -
Any Monotone Function Is Realized by Interlocked Polygons
by: Demaine, Erik D., et al.
Published: (2014) -
On k-convex polygons
by: Aichholzer, Oswin, et al.
Published: (2014) -
Any Monotone Boolean Function Can Be Realized by Interlocked Polygons
by: Demaine, Erik D., et al.
Published: (2011) -
Computing Signed Permutations of Polygon
by: Aloupis, Greg, et al.
Published: (2012)