Author:
Augustine John,Das Sandip,Maheshwari Anil,Nandy Sabhas C.,Roy Sasanka,Sarvattomananda Swami
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference20 articles.
1. A. Aggarwal, L.J. Guibas, J. Saxe, P.W. Shor, A linear time algorithm for computing the Voronoi diagram of a convex polygon, in: Proc. of the 19th Annual ACM Symposium on Theory of Computing, 1987, pp. 39–45.
2. Largest empty circle centered on a query line;Augustine;Journal of Discrete Algorithms,2010
3. The level ancestor problem simplified;Bender;Theoretical Computer Science,2004
4. Computing largest circles separating two sets of segments;Boissonnat;International Journal of Computational Geometry and Applications,2000
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Where to Place a Pile?;2023 European Conference on Mobile Robots (ECMR);2023-09-04
2. Color-spanning localized query;Theoretical Computer Science;2021-03
3. Localized Query: Color Spanning Variations;Algorithms and Discrete Applied Mathematics;2019
4. The largest empty circle with location constraints in spatial databases;Knowledge and Information Systems;2017-06-29
5. Largest Empty Square Queries in Rectilinear Polygons;Computational Science and Its Applications -- ICCSA 2015;2015