Author:
Gewali Laxmi,Jha Samridhi
Publisher
Springer International Publishing
Reference10 articles.
1. W.S. Chan, F. Chin, Approximation of polygonal curves with minimum number of line segments or minimum error. Int. J. Comput. Geom. Appl. 6, 59–77 (1996)
2. M. de Burg, M. van Kreveld, M. Overmars, O. Schwarzkopf, Computational Geometry: Algorithms and Applications, 2nd edn. (Springer, 2000)
3. D. Douglas, T. Peucker, Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Cartographica Int. J. Geogr. Inf. Geovisualiz. 10, 112–122 (1973)
4. S. Eidenbenz, Approximation algorithms for terrain guarding. Inf. Process. Lett. 82(2), 99–105 (2002)
5. L. Gewali, S. Jha, Effect of boundary approximation on visibility, (in ITNG 2021). Adv. Intell. Syst. Comput. 1346, 247–253 (2021)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Designing the Algorithms for Constructing a Triangle with Maximum Area;2023 IEEE 18th International Conference on Computer Science and Information Technologies (CSIT);2023-10-19
2. Directed Acyclic Networks and Turn Constraint Paths;Advances in Intelligent Systems and Computing;2023