On k-convex polygons
Original manuscript" July 21, 2010
Main Authors: | Aichholzer, Oswin, Aurenhammer, Franz, Demaine, Erik D., Hurtado, Ferran, Ramos, Pedro, Urrutia, Jorge |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Elsevier
2014
|
Online Access: | http://hdl.handle.net/1721.1/86056 https://orcid.org/0000-0003-3803-5703 |
Similar Items
-
Any Monotone Function Is Realized by Interlocked Polygons
by: Demaine, Erik D., 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) -
Making polygons by simple folds and one straight cut
by: Demaine, Erik D., et al.
Published: (2012) -
Area-Optimal Simple Polygonalizations: The CG Challenge 2019
by: Demaine, Erik, et al.
Published: (2022)