<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1909-8367</journal-id>
<journal-title><![CDATA[Entre Ciencia e Ingeniería]]></journal-title>
<abbrev-journal-title><![CDATA[Entre Ciencia e Ingenieria]]></abbrev-journal-title>
<issn>1909-8367</issn>
<publisher>
<publisher-name><![CDATA[Universidad Católica de Pereira]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1909-83672022000200027</article-id>
<article-id pub-id-type="doi">10.31908/19098367.2668</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Implementación de algoritmos para calcular el Convex Hull]]></article-title>
<article-title xml:lang="en"><![CDATA[Implementation of algorithms to compute the Convex Hull]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Candela]]></surname>
<given-names><![CDATA[C. A.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Sepúlveda]]></surname>
<given-names><![CDATA[L. E.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Chavarro]]></surname>
<given-names><![CDATA[J. C.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Meneses]]></surname>
<given-names><![CDATA[C. A.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Sanabria]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Arcila]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad del Quindío  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad del Quindío  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad Tecnológica de Pereira  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af4">
<institution><![CDATA[,Universidad Tecnológica de Pereira  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af5">
<institution><![CDATA[,Universidad del Valle  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af6">
<institution><![CDATA[,aff6  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2022</year>
</pub-date>
<volume>16</volume>
<numero>32</numero>
<fpage>27</fpage>
<lpage>34</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S1909-83672022000200027&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S1909-83672022000200027&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S1909-83672022000200027&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen La geometría computacional es una disciplina enfocada en la resolución de problemas en el ámbito geométrico. En este contexto, el algoritmo para calcular el polígono convexo llamado Convex Hull (CH) es importante, debido a que es la base de muchos otros algoritmos. El objetivo de la investigación fue implementar algoritmos que calculan el CH incorporando modificaciones para reducir el tiempo de ejecución. El trabajo inició con la revisión bibliográfica acerca de geometría computacional y los algoritmos destacados en el cálculo del CH. Posteriormente, se realizó la implementación en JAVA de los algoritmos QuickHull, Gift Wrapping y Graham Scan en sus versiones originales; también se implementaron algunas versiones con modificaciones. Al finalizar la implementación, se ejecutaron pruebas para verificar los tiempos de ejecución. Finalmente, se comprobó que el algoritmo QuickHull es el más rápido entre las implementaciones realizadas en esta investigación. También se nota reducción en los tiempos de ejecución en las implementaciones modificadas con relación a las originales de los algoritmos Gift Wrapping y Graham Scan.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract 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.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[Geometría computacional]]></kwd>
<kwd lng="es"><![CDATA[Covex Hull]]></kwd>
<kwd lng="es"><![CDATA[Gift Wrapping]]></kwd>
<kwd lng="es"><![CDATA[Graham Scan]]></kwd>
<kwd lng="es"><![CDATA[QuickHull]]></kwd>
<kwd lng="en"><![CDATA[Computational Geometry]]></kwd>
<kwd lng="en"><![CDATA[Convex Hull]]></kwd>
<kwd lng="en"><![CDATA[Gift Wrapping]]></kwd>
<kwd lng="en"><![CDATA[Graham Scan]]></kwd>
<kwd lng="en"><![CDATA[QuickHull]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bu-Qing]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Ding-Yuan]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computational geometry: curve and surface modeling]]></source>
<year>2014</year>
<publisher-name><![CDATA[Elsevier]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jayaram]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Fleyeh]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Convex Hulls in Image Processing: A Scoping Review]]></article-title>
<source><![CDATA[American Journal of Intelligent Systems, Artikel PeerReviewed]]></source>
<year>2016</year>
<numero>2</numero>
<issue>2</issue>
<page-range>48</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Buitrago]]></surname>
<given-names><![CDATA[O. Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Ramírez]]></surname>
<given-names><![CDATA[A. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Britto]]></surname>
<given-names><![CDATA[R. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Nuevo Algoritmo para la Construcción de la Envolvente Convexa en el Plano]]></article-title>
<source><![CDATA[New Algorithm to Construct a Planar Convex Hull]]></source>
<year>2015</year>
<volume>26</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>137-44</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Hou]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<source><![CDATA[Calculation of operational domain of virtual maintenance based on convex hull algorithm]]></source>
<year>2017</year>
<page-range>1</page-range><publisher-name><![CDATA[IEEE]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Peters]]></surname>
<given-names><![CDATA[J. F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Foundations of computer vision]]></source>
<year>2017</year>
<publisher-name><![CDATA[Springer International Publishing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Dai]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[W]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Jia]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<source><![CDATA[A convex hull based optimization to reduce the data delivery latency of the mobile elements in wireless sensor networks]]></source>
<year>2013</year>
<conf-name><![CDATA[ 10International Conference on High Performance Computing and Communications &amp; 2013 IEEE International Conference on Embedded and Ubiquitous Computing]]></conf-name>
<conf-date>2013</conf-date>
<conf-loc> </conf-loc>
<page-range>2245-52</page-range><publisher-name><![CDATA[IEEE]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Brönnimann]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Iacono]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Katajainen]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Morin]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Morrison]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Toussaint]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Space-efficient planar convex hull algorithms]]></article-title>
<source><![CDATA[Theoretical Computer Science]]></source>
<year>2004</year>
<volume>321</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>25-40</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Qihai]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[New serial and parallel algorithms for finding convex hull based on clusters, domains and directions from single to multitude]]></article-title>
<source><![CDATA[Journal of Algorithms &amp; Computational Technology]]></source>
<year>2009</year>
<volume>3</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>191-227</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[CHIANG]]></surname>
<given-names><![CDATA[H.-Y.]]></given-names>
</name>
</person-group>
<source><![CDATA[Solving 2D Convex Hull with Parallel Algorithms]]></source>
<year>2010</year>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hoang]]></surname>
<given-names><![CDATA[N.-D.]]></given-names>
</name>
<name>
<surname><![CDATA[Linh]]></surname>
<given-names><![CDATA[N. K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Quicker than Quickhull]]></article-title>
<source><![CDATA[Vietnam Journal of Mathematics]]></source>
<year>2015</year>
<volume>43</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>57-70</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Skala]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Smolik]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Majdisova]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<source><![CDATA[Reducing the number of points on the convex hull calculation using the polar space subdivision in E2]]></source>
<year>2016</year>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gamby]]></surname>
<given-names><![CDATA[A. N.]]></given-names>
</name>
<name>
<surname><![CDATA[Katajainen]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Convex-hull algorithms: Implementation, testing, and experimentation]]></article-title>
<source><![CDATA[Algorithms]]></source>
<year>2018</year>
<volume>11</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>195</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gamby]]></surname>
<given-names><![CDATA[A. N.]]></given-names>
</name>
<name>
<surname><![CDATA[Katajainen]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[A faster convex-hull algorithm via bucketing]]></source>
<year>2019</year>
<conf-name><![CDATA[ rnational Symposium on Experimental Algorithms]]></conf-name>
<conf-loc> </conf-loc>
<page-range>473-89</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Borna]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Sweep Line Algorithm for Convex Hull Revisited]]></article-title>
<source><![CDATA[Journal of Algorithms and Computation]]></source>
<year>2019</year>
<volume>51</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-14</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lesjak]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Pregled in primerjava algoritmov za izra&#269;un konveksne ovojnice]]></source>
<year>2021</year>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Preparata]]></surname>
<given-names><![CDATA[F. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Shamos]]></surname>
<given-names><![CDATA[M. I.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Computational Geometry An Introduction]]></article-title>
<source><![CDATA[Computational Geometry]]></source>
<year>1985</year>
<page-range>1-35</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sack]]></surname>
<given-names><![CDATA[J.-R.]]></given-names>
</name>
<name>
<surname><![CDATA[Urrutia]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Handbook of computational geometry]]></source>
<year>1999</year>
<publisher-name><![CDATA[Elsevier]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Berg]]></surname>
<given-names><![CDATA[M. De]]></given-names>
</name>
<name>
<surname><![CDATA[Van Kreveld]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Overmars]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computational Geometry: Algorithms and Applications]]></source>
<year>2008</year>
<edition>Third</edition>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[o'Rourke]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Mallinckrodt]]></surname>
<given-names><![CDATA[A. J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Computational geometry in C]]></article-title>
<source><![CDATA[Computers in Physics]]></source>
<year>1995</year>
<volume>9</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>55</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Eddy]]></surname>
<given-names><![CDATA[W. F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new convex hull algorithm for planar sets]]></article-title>
<source><![CDATA[ACM Transactions on Mathematical Software (TOMS)]]></source>
<year>1977</year>
<volume>3</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>398-403</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bykat]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Convex hull of a finite set of points in two dimensions]]></article-title>
<source><![CDATA[Information Processing Letters]]></source>
<year>1978</year>
<volume>7</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>296-8</page-range></nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Linh]]></surname>
<given-names><![CDATA[N. K.]]></given-names>
</name>
<name>
<surname><![CDATA[An]]></surname>
<given-names><![CDATA[P. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Van Hoai]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A fast and efficient algorithm for determining the connected orthogonal convex hulls]]></article-title>
<source><![CDATA[Applied Mathematics and Computation]]></source>
<year>2022</year>
<volume>429</volume>
<page-range>127183</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Steier]]></surname>
<given-names><![CDATA[D. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Anderson]]></surname>
<given-names><![CDATA[A. P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Algorithm Synthesis: A comparative study]]></source>
<year>2012</year>
<publisher-name><![CDATA[Springer Science &amp; Business Media]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chand]]></surname>
<given-names><![CDATA[D. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Kapur]]></surname>
<given-names><![CDATA[S. S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An algorithm for convex polytopes]]></article-title>
<source><![CDATA[Journal of the ACM (JACM)]]></source>
<year>1970</year>
<volume>17</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>78-86</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Graham]]></surname>
<given-names><![CDATA[R. L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An efficient algorithm for determining the convex hull of a finite planar set]]></article-title>
<source><![CDATA[Info. Pro. Lett]]></source>
<year>1972</year>
<volume>1</volume>
<page-range>132-3</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
