.png){kind=icon}
返回
Optimal area polygonization problems: Exact solutions through geometric duality
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2022.105842.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we describe exact methods to solve two problems: given a set S of n points in the plane, find a simple polygon whose set of vertices is precisely S and has minimum (MIN-AREA) or maximum (MAX-AREA) area. These problems are strongly related to the Euclidean TSP, whilst the goal here is to min/max-imize the finite area bounded by the cycle. Both problems are known to be NP-complete. Previous works focused on heuristic methods, specially in 2019, where considerable attention was given to them due to a worldwide contest that took place as part of the Computational Geometry Week. Moreover, to the best of our knowledge, there is only one work aimed to solve these problems exactly. Our main contributions include a novel Integer Linear Programming (ILP) formulation for these problems, along with preprocessing and formulation strengthening techniques to improve its performance in practice. We conducted an extensive experimental study to assess the effectiveness of our model and its variants, and to compare our results to the literature. With respect to the latter analysis, we achieved a speedup of approximately 11.46 (2.21) on average for MIN-AREA (MAX-AREA), when compared to the best known model.
Keyword:
Polygonization
Integer programming
Computational geometry
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
The role of anemia and vitamin D levels in acute and chronic telogen effluvium贫血和维生素D水平在急性与慢性休止期脱发中的作用
OAAI
OAAI分享收藏Micronutrient Deficiencies and Digital Computerized Phototrichogram Analysis in Telogen Effluvium: A Retrospective Correlation Study in a Tertiary Medical Center微量营养素缺乏与数字化计算机化光头图像分析在休止期脱发中的应用：一家三级医疗中心回顾性相关性研究OAAI
OAAI分享收藏 没有更多内容
没有更多内容