DocumentCode :
725243
Title :
An alternative approach for computing monotone polygon
Author :
Dhanuka, Priyam ; Bharwani, Anandi ; Kaur, Kamaljit ; Mohanty, Manas Kumar ; Sadhu, Sanjib
Author_Institution :
Dept. of Comput. Sci. & Eng., Nat. Inst. of Technol., Durgapur, India
fYear :
2015
fDate :
19-20 March 2015
Firstpage :
42
Lastpage :
45
Abstract :
An algorithm has been designed to compute a random monotone polygon from an input set of points lying on a 2-D dimensional plane. Our algorithm is based on sweep line method with some modifications and it computes monotone polyogn in O(nlogn) time complexity and O(n) space complexity. LEDA software has been used to execute our algorithm.
Keywords :
computational complexity; computational geometry; LEDA software; alternative approach; computing monotone polygon; random monotone polygon; space complexity; sweep line method; time complexity; Algorithm design and analysis; Binary search trees; Computational geometry; Computer science; Electronic mail; Software algorithms; Time complexity; Algorithm; Convex Hull; Monotone Polygon; Sweep Line Technique;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Engineering and Applications (ICACEA), 2015 International Conference on Advances in
Conference_Location :
Ghaziabad
Type :
conf
DOI :
10.1109/ICACEA.2015.7164710
Filename :
7164710
Link To Document :
بازگشت