<?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>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462016000400789</article-id>
<article-id pub-id-type="doi">10.13053/cys-20-4-2387</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Validación de la triangulación Delaunay empleando algebra geométrica conforme]]></article-title>
<article-title xml:lang="en"><![CDATA[Delaunay Triangulation Validation Using Conformal Geometric Algebra]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Romero]]></surname>
<given-names><![CDATA[Netz]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Barrón-Fernández]]></surname>
<given-names><![CDATA[Ricardo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Instituto Politécnico Nacional Centro de Investigación en Computación ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2016</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2016</year>
</pub-date>
<volume>20</volume>
<numero>4</numero>
<fpage>789</fpage>
<lpage>798</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462016000400789&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462016000400789&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462016000400789&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen Cuando la triangulación Delaunay se realiza en forma incremental, la etapa más importante, es la reconstrucción de los triángulos cuando se inserta aleatoriamente un nuevo punto en la red. Para ello existen diferentes técnicas, de la cual utilizaremos la validación del "círculo vacío" descrita por Boris Deloné, nuestro objetivo es utilizar el Álgebra Geométrica Conforme (AGC) para realizar dicha validación. Cambiaremos de ambiente matemático para demostrar las ventajas de las entidades geométricas que nos propone el AGC y emplearlas en un módulo que valide dicha triangulación.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract When Delaunay triangulation is performed in an incremental fashion, different steps are involved in the process. Within those steps "reconstruction" is the most important stage when a new point is randomly inserted. Although there are several techniques to perform this reconstruction, one of the most relevant is a validation technique called "empty circle", described by Boris Deloné. In this paper, we focus on the use of the Conformal Geometric Algebra (CGA) to perform such validation. In addition, the proposal includes a mathematical environment change to show the advantages of using CGA's geometric entities and use them inside a module for validating the triangulation.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[Álgebra geométrica conforme]]></kwd>
<kwd lng="es"><![CDATA[círculo vacío]]></kwd>
<kwd lng="es"><![CDATA[triangulación Delaunay]]></kwd>
<kwd lng="en"><![CDATA[Conformal geometric algebra]]></kwd>
<kwd lng="en"><![CDATA[empty circle]]></kwd>
<kwd lng="en"><![CDATA[Delaunay triangulation]]></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[Zonnenberg]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Conformal Geometric Algebra Package]]></source>
<year>2007</year>
<publisher-name><![CDATA[Utrecht University]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="">
<source><![CDATA[The Computational Geometry Algorithms Library]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dorst]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Fontijne]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Mann]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Geometric Algebra for Computer Science: an object oriented approach to geometry]]></source>
<year>2007</year>
<page-range>415-7</page-range><publisher-name><![CDATA[Morgan Kaufman publishers]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="">
<source><![CDATA[Geometric Algebra for Computer Science and Object Oriented approach for Geometry]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[CAUSTA: Clifford Algebra-based Unified Spatio-Temporal Analysis]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yuan]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Yu]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Luo]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Lü]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Transactions in GIS]]></source>
<year>2010</year>
<volume>14</volume>
<page-range>59-83</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Sur la sphere vide]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Deloné]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[Bulletin of the Academy of Sciences of the U.S.S.R]]></source>
<year>1934</year>
<volume>6</volume>
<page-range>793-800</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A TIN compression method using Delaunay triangulation]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Park]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Cho]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<source><![CDATA[Int. J. Geographical Information Science]]></source>
<year>2001</year>
<volume>15</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>255-69</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kang]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[A spatial data mining method by Delaunay triangulation]]></source>
<year>1997</year>
<conf-name><![CDATA[ 5ACM int. workshop on Advances in GIS]]></conf-name>
<conf-loc> </conf-loc>
<page-range>35-9</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Heller]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Triangulation algorithms for adaptive terrain modeling]]></source>
<year>1990</year>
<conf-name><![CDATA[ 4Internat. Sympos. Spatial Data Handling]]></conf-name>
<conf-loc> </conf-loc>
<page-range>163-74</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Grassmann]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Linear Extension Theory (Die Lineale Ausdehnungslehre)]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Kannenberg]]></surname>
<given-names><![CDATA[L. C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Ausdehnungslehre of 1844 and Other Works]]></source>
<year>1844</year>
<publisher-name><![CDATA[Open Court Publ.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Applications of Grassmann's Extensive Algebra]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Clifford]]></surname>
<given-names><![CDATA[W.K.]]></given-names>
</name>
</person-group>
<source><![CDATA[American Journal of Mathematics]]></source>
<year>1878</year>
<volume>1</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>350-8</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hestenes]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Sobczyk]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Clifford Algebra to Geometric Calculus]]></source>
<year>1984</year>
<publisher-loc><![CDATA[Dordrecht/Boston ]]></publisher-loc>
<publisher-name><![CDATA[Reidel Publ. Co.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bayro]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Handbook of Computational Geometry for Pattern Recognition, Computer Vision, Neurocomputing and Robotics]]></source>
<year>2005</year>
<publisher-loc><![CDATA[Berlin Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Guibas]]></surname>
<given-names><![CDATA[L. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Stolfi]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[ACM Transactions on Graphics]]></source>
<year>1985</year>
<volume>4</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>74-123</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Randomized incremental construction of Delaunay and Voronoi diagrams]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Guibas]]></surname>
<given-names><![CDATA[L. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Knuth]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Sharir]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<source><![CDATA[Algorithmica]]></source>
<year>1992</year>
<volume>7</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>381 -413</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A sweep-line algorithm for Voronoi diagrams]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fortune]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Algorithmica]]></source>
<year>1987</year>
<volume>2</volume>
<page-range>153-74</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Two algorithms for constructing a Delaunay triangulation]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[D. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Schachter]]></surname>
<given-names><![CDATA[B. J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Journal of Computer and Information Sciences]]></source>
<year>1980</year>
<volume>9</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>219-42</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A faster divide-and-conquer algorithm for constructing Delaunay triangulations]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dwyer]]></surname>
<given-names><![CDATA[R. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Algorithmica]]></source>
<year>1987</year>
<volume>2</volume>
<page-range>137-51</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lawson]]></surname>
<given-names><![CDATA[C.L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Mathematical software III; Software for C1 surface interpolation]]></source>
<year>1977</year>
<page-range>161-94</page-range><publisher-name><![CDATA[Academic Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Berg]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Kreveld]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Overmars]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Schwarzkopf]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computational geometry, algorithms and applications]]></source>
<year>1997</year>
<publisher-loc><![CDATA[Berlin ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Computing Dirichlet tessellations]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bowyer]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[The Computer Journal]]></source>
<year>1981</year>
<volume>24</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>162-6</page-range></nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Watson]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[The Computer Journal]]></source>
<year>1981</year>
<volume>24</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>167-72</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mücke]]></surname>
<given-names><![CDATA[E.P.]]></given-names>
</name>
<name>
<surname><![CDATA[Saias]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhu]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computational Geometry]]></source>
<year>1999</year>
<volume>12</volume>
<page-range>63-83</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hildenbrand]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Foundations of Geometric Algebra Computing]]></source>
<year>2013</year>
<publisher-loc><![CDATA[Berlin Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Perwass]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Geometric Algebra with Applications in Engineering]]></source>
<year>2009</year>
<publisher-loc><![CDATA[Berlin Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="">
<source><![CDATA[Interactive Visualization]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="">
<source><![CDATA[GAALOP Geometric Algebra Algorithms Optimizer]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schwinn]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Hildenbrand]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Stock]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Koch]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Gaalop 2.0 - a geometric algebra algorithm compiler]]></source>
<year>2010</year>
<conf-name><![CDATA[ International Workshop on Computer Graphics, Computer Vision and Mathematics]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1 -8</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
