.png){kind=icon}
返回
Efficient algorithms for geometric optimization
.png){kind=icon}
OA
AI
DOI：10.1145/299917.299918.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We review the recent progress in the design of efficient algorithms for various problems in geometric optimization. We present several techniques used to attack these problems, such as parametric searching, geometric alternatives to parametric searching, prune-and-search techniques for linear programming and related problems, and LP-type problems and their efficient solution. We then describe a wide range of applications of these and other techniques to numerous problems in geometric optimization, including facility location, proximity problems, statistical estimators and metrology, placement and intersection of polygons and polyhedra, and ray shooting and other query-type problems.
Keyword:
clustering
collision detection
linear programming
matrix searching
parametric searching
proximity problems
prune-and-search
randomized algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
28
论文数:
2.5K
被引数:
3.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
Health-Related Quality of Life of Children and Adolescents With Type 1 or Type 2 Diabetes Mellitus
PREAI
分享收藏
查看更多内容