COMPUTATIONAL GEOMETRY: THE CONVEXHULL PROBLEM
DOI:
https://doi.org/10.15381/idata.v8i2.6192Keywords:
Computational geometry, Voronoi diagrams, motion planning, convex hull problem, Graham algorithm.Abstract
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.
Downloads
Downloads
Published
Issue
Section
License
Copyright (c) 2005 Edgar Ruiz Lizama, Eduardo Raffo Lecca
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
AUTHORS RETAIN THEIR RIGHTS:
a. Authors retain their trade mark rights and patent, and also on any process or procedure described in the article.
b. Authors retain their right to share, copy, distribute, perform and publicly communicate their article (eg, to place their article in an institutional repository or publish it in a book), with an acknowledgment of its initial publication in the INDUSTRIAL DATA.
c. Authors retain theirs right to make a subsequent publication of their work, to use the article or any part thereof (eg a compilation of his papers, lecture notes, thesis, or a book), always indicating the source of publication (the originator of the work, journal, volume, number and date).
