Author:
Roy Sasanka,Bardhan Debabrata,Das Sandip
Subject
Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software
Reference15 articles.
1. A linear time algorithm for computing the Voronoi diagram of a convex polygon;Aggarwal,1987
2. A. Aggarwal, D. Kravets, A linear time algorithm for finding all furthest neighbours in a convex polygon, Inform. Process. Lett. (1989) 17–20.
3. The discrete 2-center problem;Agarwal,1997
4. Computing the constrained Euclidean, geodesic and link center of a simple polygon with applications;Bose,1996
5. More planar two-center algorithms;Chan;Computational Geometry: Theory and Application,1999
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Lion Swarm Optimization for Base Station Placement;2023 14th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI);2023-07-08
2. Optimal Algorithms for Covering a Rectangle with Identical Circles;2023 14th International Conference on Computing Communication and Networking Technologies (ICCCNT);2023-07-06
3. Covering convex polygons by two congruent disks;Computational Geometry;2023-02
4. The Euclidean k-supplier problem in IR2;Operations Research Letters;2021-01
5. Covering Convex Polygons by Two Congruent Disks;Lecture Notes in Computer Science;2021