COMPUTATIONAL GEOMETRY: THE CONVEXHULL PROBLEM
The objective of this work is to show fundamental concepts of computational geometry and one solution for the convex hull problem, using the Graham algorithm. The authors use the Java language programming in order to implement the solution.
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2005 |
| País: | Perú |
| Institución: | Universidad Nacional Mayor de San Marcos |
| Repositorio: | Revistas - Universidad Nacional Mayor de San Marcos |
| Idioma: | español |
| OAI Identifier: | oai:revistasinvestigacion.unmsm.edu.pe:article/6192 |
| Acceso en línea: | https://revistasinvestigacion.unmsm.edu.pe/index.php/idata/article/view/6192 |
| Access Level: | acceso abierto |
| Palabra clave: | Computational geometry Voronoi diagrams motion planning convex hull problem Graham algorithm. Geometría computacional diagramas de Voronoi planeamiento de movimiento problema del cerco convexo algoritmo de Graham. |
| Sumario: | The objective of this work is to show fundamental concepts of computational geometry and one solution for the convex hull problem, using the Graham algorithm. The authors use the Java language programming in order to implement the solution. |
|---|