Convex polygon recognition | |
| Author | Kieu Trong Khanh |
| Call Number | AIT Thesis no.CS-05-28 |
| Subject(s) | Computer algorithms Polygons |
| Note | A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Advanced Technologies |
| Publisher | Asian Institute of Technology |
| Series Statement | Thesis ; no. CS-05-28 |
| Abstract | A new method is presented to detect with extremely high probability a convex polygon from a given finite collection. The main objective is to detect convex polygons with speed, accuracy, and effectiveness. It uses 0(1) finger probes and is based on heuristic analysis. Theoretical convex polygon recognition algorithms are developed implemented. The implementation is based on data structures of computational geometry, in particular, orthogonal range search structures such as KD-Tree and Range Tree, and is written in Java language |
| Year | 2005 |
| Corresponding Series Added Entry | Asian Institute of Technology. Thesis ; no. CS-05-28 |
| Type | Thesis |
| School | School of Advanced Technologies (SAT) |
| Department | Department of Information and Communications Technologies (DICT) |
| Academic Program/FoS | Computer Science (CS) |
| Chairperson(s) | Guha, Sumanta; |
| Examination Committee(s) | Phan Minh Dung;Batanov, Dencho N.; |
| Scholarship Donor(s) | People Committee of Ho Chi Minh City Training Project for 300 Prospective Master/Doctorate Awardees; |
| Degree | Thesis (M.Eng.) - Asian Institute of Technology, 2005 |