The Expected Number of Extreme Discs
Tạp chí Khoa học Đại học Quốc gia Hà Nội Toán - Lý (VNU Journal of Science Mathematics - Physics)(2019)
摘要
Abstract: Given a finite set D of n planar discs whose centers are distributed randomly. We are interested in the expected number of extreme discs of the convex hull of D. We show that the expected number of extreme discs is at most O(log2n) for any distribution. This result can be used to derive expected complexity of convex hull algorithms. Keywords: Convex hull, computational geometry, expected number. Mathematics Subject Classification (2010): 65D18, 52A15, 51N05.
更多查看译文
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要