Computational Geometric Problems in Pattern Recognition-Reference-Cited by-同舟云学术

Computational Geometric Problems in Pattern Recognition

Published:1982 Issue: Volume: Page:73-91
ISSN:
Container-title:Pattern Recognition Theory and Applications
language:
Short-container-title:

Author:

Toussaint Godfried T.

Publisher

Springer Netherlands

Link

http://link.springer.com/content/pdf/10.1007/978-94-009-7772-3_7.pdf

Reference66 articles.

1. Avis, D, D., “The number of furthest-neighbor pairs of a finite planar set,” Tech. Rept. No. SOCS-81. 8, School of Computer Science, McGill University, February 1981.

2. Avis, D., “Lower bounds for geometric problems,” Proceedings of the Allerton Comference, Urbana, Illinois, October 1980.

3. Avis, D. and G.T. Toussaint, “An efficient algorithm for decomposing a polygon into star-shaped polygons,” Pattern Recognition, 1981, to appear.

4. Avis, D., G.T. Toussaint and B.K. Bhattacharya, “On the multimodality of distances in convex polygons,” Tech. Rept. No. SOCS-81. 6, School of Computer Science, McGill University, February 1981.

5. Bentley, J.L., B.W. Weide and A.C. Yao, “Optimal expected- time algorithms for closest point problems,” ACM Transactions on Mathematical Software, Vol. 6, No. 4, December 1980, pp. 563–580.

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

1. Minimum Star Partitions of Simple Polygons in Polynomial Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Normal approximation in total variation for statistics in geometric probability;Advances in Applied Probability;2023-07-03

3. Convergence rate for geometric statistics of point processes having fast decay of dependence;Electronic Journal of Probability;2023-01-01

4. SIG-dimension conjecture proved for graphs having a perfect matching;Discrete Mathematics, Algorithms and Applications;2017-02

5. On the SIG-Dimension of Trees Under the L ∞-Metric;Graphs and Combinatorics;2012-03-29