Implementation of algorithms to compute the Convex Hull
Computational geometry is a discipline focused on solving problems in the geometric domain. In this context, the algorithm for computing the convex polygon called Convex Hull (CH) is important, because it is the basis for many other algorithms. The objective of the research was to implement algorith...
- Autores:
- Tipo de recurso:
- Article of journal
- Fecha de publicación:
- 2022
- Institución:
- Universidad Católica de Pereira
- Repositorio:
- Repositorio Institucional - RIBUC
- Idioma:
- spa
- OAI Identifier:
- oai:repositorio.ucp.edu.co:10785/13703
- Acceso en línea:
- https://revistas.ucp.edu.co/index.php/entrecienciaeingenieria/article/view/2668
http://hdl.handle.net/10785/13703
- Palabra clave:
- Rights
- openAccess
- License
- Derechos de autor 2023 Entre Ciencia e Ingeniería
| Summary: | Computational geometry is a discipline focused on solving problems in the geometric domain. In this context, the algorithm for computing the convex polygon called Convex Hull (CH) is important, because it is the basis for many other algorithms. The objective of the research was to implement algorithms that compute the CH incorporating modifications to reduce the execution time. The research started with a bibliographic review of computational geometry and the algorithms highlighted in the calculation of CH. Subsequently, the QuickHull, Gift Wrapping, and Graham Scan algorithms were implemented in JAVA in their original versions; some versions with modifications were also implemented. Upon completion of implementation, tests were run to verify the execution times. Finally, the QuickHull algorithm was found to be the fastest among the implementations performed in this research. It is also noted a reduction in execution times in the modified implementations in relation to the original ones of the Gift Wrapping and Graham Scan algorithms. |
|---|