Convex Hulls under Uncertainty-Reference-Cited by-同舟云学术

Convex Hulls under Uncertainty

Published:2014 Issue: Volume: Page:37-48
ISSN:0302-9743
Container-title:Algorithms - ESA 2014
language:
Short-container-title:

Author:

Agarwal Pankaj K.,Har-Peled Sariel,Suri Subhash,Yıldız Hakan,Zhang Wuzhou

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-44777-2_4

Reference17 articles.

1. Agarwal, P.K., Aronov, B., Har-Peled, S., Phillips, J.M., Yi, K., Zhang, W.: Nearest neighbor searching under uncertainty II. In: Proc. 32nd ACM Sympos. Principles Database Syst., pp. 115–126 (2013)

2. Agarwal, P.K., Cheng, S., Tao, Y., Yi, K.: Indexing uncertain data. In: Proc. 28th ACM Sympos. Principles Database Syst., pp. 137–146 (2009)

3. Agarwal, P.K., Har-Peled, S., Suri, S., Yıldız, H., Zhang, W.: Convex hulls under uncertainty. CoRR abs/1406.6599 (2014), http://arxiv.org/abs/1406.6599

4. Agarwal, P.K., Sharir, M., Welzl, E.: Algorithms for center and Tverberg points. ACM Trans. Algo. 5(1), 5:1–5:20 (2008)

5. Chazelle, B.: Cutting hyperplanes for divide-and-conquer. Discrete Comput. Geom. 9(1), 145–158 (1993)

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Line-Constrained L∞ One-Center Problem on Uncertain Points;Proceedings of the 3rd International Conference on Advanced Information Science and System;2021-11-26

2. The most-likely skyline problem for stochastic points;Computational Geometry;2020-06

3. A fully polynomial time approximation scheme for the smallest diameter of imprecise points;Theoretical Computer Science;2020-04

4. On the expected diameter, width, and complexity of a stochastic convex hull;Computational Geometry;2019-09

5. Covering Uncertain Points in a Tree;Algorithmica;2019-01-22