Opening book details…
Can I read Area-Optimal Simple Polygonalizations: The CG Challenge 2019 on EtoBox?
Area-Optimal Simple Polygonalizations: The CG Challenge 2019 by Demaine, Erik D. (author);Fekete, Sándor P. (author);Keldenich, Phillip (author);Krupke, Dominik (author);Mitchell, Joseph S. B. (author) is a Computer Science article available to read on EtoBox.
What is Area-Optimal Simple Polygonalizations: The CG Challenge 2019 about?
We give an overview of theoretical and practical aspects of finding a simple polygon of minimum ( Min-Area ) or maximum ( Max-Area ) possible area for a given set of n points in the plane. Both problems are known to be NP -hard and were the subject of the 2019 Computational Geometry Challenge, which presented the quest of finding good solutions to more than 200 instances, ranging from n = 10 all the way to n = 1, 000, 000.
Who reads Area-Optimal Simple Polygonalizations: The CG Challenge 2019?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Demaine, Erik D. (author);Fekete, Sándor P. (author);Keldenich, Phillip (author);Krupke, Dominik (author);Mitchell, Joseph S. B. (author)
- Publisher
- Association for Computing Machinery (ACM)
- Published
- 2022
- Language
- EN
- Field
- Computer Science (Physical Sciences)