<?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-55462017000200275</article-id>
<article-id pub-id-type="doi">10.13053/cys-21-2-2737</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Compact Union of Disjoint Boxes: An Efficient Decomposition Model for Binary Volumes]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Cruz-Matías]]></surname>
<given-names><![CDATA[Irving]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Ayala]]></surname>
<given-names><![CDATA[Dolors]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad de Monterrey  ]]></institution>
<addr-line><![CDATA[San Pedro Garza García ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universitat Politècnica de Catalunya  ]]></institution>
<addr-line><![CDATA[Barcelona ]]></addr-line>
<country>Spain</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2017</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2017</year>
</pub-date>
<volume>21</volume>
<numero>2</numero>
<fpage>275</fpage>
<lpage>292</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462017000200275&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-55462017000200275&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-55462017000200275&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: This paper presents in detail the Compact Union of Disjoint Boxes (CUDB), a decomposition model for binary volumes that has been recently but briefly introduced. This model is an improved version of a previous model called Ordered Union of Disjoint Boxes (OUDB). We show here, several desirable features that this model has versus OUDB, such as less unitary basic elements (boxes) and thus, a better efficiency in some neighborhood operations. We present algorithms for conversion to and from other models, and for basic computations as area (2D) or volume (3D). We also present an efficient algorithm for connected-component labeling (CCL) that does not follow the classical two-pass strategy. Finally we present an algorithm for collision (or adjacency) detection in static environments. We test the efficiency of CUDB versus existing models with several datasets.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Binary volumes]]></kwd>
<kwd lng="en"><![CDATA[orthogonal polyhedra]]></kwd>
<kwd lng="en"><![CDATA[connected-component labeling]]></kwd>
<kwd lng="en"><![CDATA[collision detection]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Aguilera]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[Orthogonal Polyhedra: Study and Application]]></source>
<year>1998</year>
<publisher-name><![CDATA[LSI, Universitat Politècnica de Catalunya]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Aguilera]]></surname>
<given-names><![CDATA[A. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Ayala]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Orthogonal Polyhedra as Geometric Bounds in Constructive Solid Geometry]]></source>
<year>1997</year>
<conf-name><![CDATA[ Fourth ACM Symposium on Solid Modeling and Applications]]></conf-name>
<conf-loc> </conf-loc>
<page-range>56&#8211;67</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Aguilera]]></surname>
<given-names><![CDATA[A. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Ayala]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Converting Orthogonal Polyhedra from Extreme Vertices Model to B-Rep and to Alternating Sum of Volumes]]></article-title>
<source><![CDATA[Geometric Modeling]]></source>
<year>2001</year>
<volume>14</volume>
<numero>^sComputing Supplement</numero>
<issue>^sComputing Supplement</issue>
<supplement>Computing Supplement</supplement>
<page-range>1&#8211;28</page-range><publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ayala]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Vergara]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Vergés]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Improved skeleton computation of an encoded volume]]></article-title>
<source><![CDATA[Proc. of Eurographics]]></source>
<year>2007</year>
<volume>2007</volume>
<page-range>33&#8211;36</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ayala]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Vergés]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Improved virtual porosimeter]]></source>
<year>2008</year>
<publisher-name><![CDATA[CASEIB&#8217;08]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ayala]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Vergés]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Structural parameters computation of a volume using alternative representations]]></source>
<year>2009</year>
<conf-name><![CDATA[ Proceedings of IV Iberoamerican Symposium in Computer Graphics]]></conf-name>
<conf-loc>C.A. </conf-loc>
<page-range>73&#8211;80</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ayala]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Vergés]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Cruz]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
</person-group>
<source><![CDATA[A polyhedral approach to compute the genus of a volume dataset]]></source>
<year>2012</year>
<conf-name><![CDATA[ Proc. of the Int. Conf. GRAPP 2012]]></conf-name>
<conf-loc> </conf-loc>
<page-range>38&#8211;47</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Biedl]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Genç]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Reconstructing orthogonal polyhedra from putative vertex sets]]></article-title>
<source><![CDATA[Computational Geometry]]></source>
<year>2011</year>
<volume>44</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>409&#8211; 417</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Biswas]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Bhowmick]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Sarkar]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Bhat-tacharya]]></surname>
<given-names><![CDATA[B. B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A linear-time combinatorial algorithm to find the orthogonal hull of an object on the digital plane]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2012</year>
<volume>216</volume>
<page-range>176&#8211;195</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bournez]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Maler]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Pnueli]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Orthogonal polyhedra: Representation and computation]]></article-title>
<source><![CDATA[Hybrid Systems: Computation and Control]]></source>
<year>1999</year>
<page-range>46&#8211;60</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Brunet]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Juan]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Navazo]]></surname>
<given-names><![CDATA[M. I.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Octree representations in solid modeling]]></article-title>
<source><![CDATA[Progress in Computer Graphics]]></source>
<year>1992</year>
<volume>1</volume>
<page-range>164&#8211;215</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cohen]]></surname>
<given-names><![CDATA[J. D.]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[M. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Manocha]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Ponamgi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[I-collide: an interactive and exact collision detection system for large-scale environments]]></source>
<year>1995</year>
<conf-name><![CDATA[ Proc. of the 1995 Sym. on Interactive 3D graphics]]></conf-name>
<conf-loc> </conf-loc>
<page-range>189&#8211;ff</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Coming]]></surname>
<given-names><![CDATA[D. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Staadt]]></surname>
<given-names><![CDATA[O. G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Velocity-aligned discrete oriented polytopes for dynamic collision detection]]></article-title>
<source><![CDATA[IEEE Transactions on Visualization and Computer Graphics]]></source>
<year>2008</year>
<volume>14</volume>
<page-range>1&#8211;12</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cruz-Matías]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Ayala]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[An efficient alternative to compute the genus of binary volume models]]></source>
<year>2013</year>
<conf-name><![CDATA[ Proc. of the Int. Conf. GRAPP 2013]]></conf-name>
<conf-loc> </conf-loc>
<page-range>18&#8211;26</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cruz-Matías]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Ayala]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new lossless orthogonal simplification method for 3D objects based on bounding structures]]></article-title>
<source><![CDATA[Graphical Models]]></source>
<year>2014</year>
<volume>76</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>181&#8211;201</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dang]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Maler]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Reachability analysis via face lifting]]></article-title>
<source><![CDATA[Hybrid Systems: Computation and Control]]></source>
<year>1998</year>
<page-range>96&#8211;109</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dillencourt]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Samet]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Tamminen]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A general approach to connected-component labeling for arbitrary image representations]]></article-title>
<source><![CDATA[Journal of the ACM]]></source>
<year>1992</year>
<volume>39</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>253&#8211;280</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Eppstein]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Mumford]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Steinitz theorems for orthogonal polyhedra]]></source>
<year>2010</year>
<conf-name><![CDATA[ Proceedings of the 2010 annual symposium on Computational geometry]]></conf-name>
<conf-loc> </conf-loc>
<page-range>429&#8211;438</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Esperança]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Samet]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Vertex representations and their applications in computer graphics]]></article-title>
<source><![CDATA[The Visual Computer]]></source>
<year>1998</year>
<volume>14</volume>
<page-range>240&#8211; 256</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Flores]]></surname>
<given-names><![CDATA[J. A. M]]></given-names>
</name>
</person-group>
<source><![CDATA[Analysis and Visualization of Complex 3D Structures: a discrete boundary-based approach]]></source>
<year>1999</year>
<publisher-name><![CDATA[Ecole Nationale Supérieure des Télécommunications]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Foley]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Damm]]></surname>
<given-names><![CDATA[A. V.]]></given-names>
</name>
<name>
<surname><![CDATA[Feiner]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Hughes]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computer graphics: principles and practice]]></source>
<year>1997</year>
<publisher-name><![CDATA[Pearson Education]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gagvani]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Silver]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Shape-based volumetric collision detection]]></source>
<year>2000</year>
<conf-name><![CDATA[ Proc. of the 2000 IEEE Sym. on Volume visualization]]></conf-name>
<conf-loc> </conf-loc>
<page-range>57&#8211;61</page-range></nlm-citation>
</ref>
<ref id="B23">
<label>23</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Geleri]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Tosun]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Topcuoglu]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Parallelizing broad phase collision detection algo-rithms for sampling based path planners]]></source>
<year>2013</year>
<conf-name><![CDATA[ Proc. of the 21st Euromicro Int. Conference on Parallel, Distributed, and Network-Based Processing]]></conf-name>
<conf-loc> </conf-loc>
<page-range>384&#8211;391</page-range></nlm-citation>
</ref>
<ref id="B24">
<label>24</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Greß]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Klein]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficient representation and extraction of 2-manifold isosurfaces using kd-trees]]></article-title>
<source><![CDATA[Graphical Models]]></source>
<year>2004</year>
<volume>66</volume>
<page-range>370&#8211;397</page-range></nlm-citation>
</ref>
<ref id="B25">
<label>25</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Grevera]]></surname>
<given-names><![CDATA[G. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Udupa]]></surname>
<given-names><![CDATA[J. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Odhner]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An Order of Magnitude Faster Isosurface Rendering in Software on a PC than Using Dedicated, General Purpose Rendering Hardware]]></article-title>
<source><![CDATA[IEEE Transactions Visualization and Computer Graphics]]></source>
<year>2000</year>
<volume>6</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>335&#8211;345</page-range></nlm-citation>
</ref>
<ref id="B26">
<label>26</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Grisan]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Foracchia]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Ruggeri]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[A novel method for the automatic evaluation of retinal vessel tortuosity]]></source>
<year>2003</year>
<volume>1</volume>
<conf-name><![CDATA[ Proc. of the 25th Annual Int. Conf. of the IEEE EMBS]]></conf-name>
<conf-loc> </conf-loc>
<page-range>866&#8211;869</page-range></nlm-citation>
</ref>
<ref id="B27">
<label>27</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gupta]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Palsetia]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Patwary]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Mostofa]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Agrawal]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Choudhary]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[A new parallel algorithm for two-pass connected component labeling]]></source>
<year>2014</year>
<conf-name><![CDATA[ IEEE International Parallel &amp; Distributed Processing Symposium Workshops (IPDPSW)]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1355&#8211;1362</page-range></nlm-citation>
</ref>
<ref id="B28">
<label>28</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[He]]></surname>
<given-names><![CDATA[L.-F.]]></given-names>
</name>
<name>
<surname><![CDATA[Chao]]></surname>
<given-names><![CDATA[Y.-Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Suzuki]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An algorithm for connected-component labeling, hole labeling and euler number computing]]></article-title>
<source><![CDATA[Journal of Computer Science and Technology]]></source>
<year>2013</year>
<volume>28</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>468&#8211;478</page-range></nlm-citation>
</ref>
<ref id="B29">
<label>29</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hopcroft]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Tarjan]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Algorithm 447: efficient algorithms for graph manipulation]]></article-title>
<source><![CDATA[Communications of the ACM]]></source>
<year>1973</year>
<volume>16</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>372&#8211;378</page-range></nlm-citation>
</ref>
<ref id="B30">
<label>30</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jiménez]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Thomas]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Torras]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[3D collision detection: A survey]]></article-title>
<source><![CDATA[Computers &amp; Graphics]]></source>
<year>2000</year>
<volume>25</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>269&#8211;285</page-range></nlm-citation>
</ref>
<ref id="B31">
<label>31</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kaufman]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[Volume Visualization]]></source>
<year>1990</year>
<publisher-name><![CDATA[IEEE Computer Society Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B32">
<label>32</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kaufman]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Cohen]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Yagel]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Volume graphics]]></article-title>
<source><![CDATA[Computer]]></source>
<year>1993</year>
<page-range>51&#8211;64</page-range></nlm-citation>
</ref>
<ref id="B33">
<label>33</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lachaud]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Montanvert]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Continuous analogs of digital boundaries: A topological approach to iso-surfaces]]></article-title>
<source><![CDATA[Graphical Models]]></source>
<year>2000</year>
<volume>62</volume>
<page-range>129&#8211;164</page-range></nlm-citation>
</ref>
<ref id="B34">
<label>34</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Choi]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Park]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A method of 3D object reconstruction from a series of cross-sectional images]]></article-title>
<source><![CDATA[IEICE trans. inf and syst]]></source>
<year>1994</year>
<volume>E77-D</volume>
<numero>9</numero>
<issue>9</issue>
</nlm-citation>
</ref>
<ref id="B35">
<label>35</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lifeng]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Xiao]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Bin]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Yun]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Yuyan]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An efficient two-scan labeling algorithm for binary hexagonal images]]></article-title>
<source><![CDATA[IEICE TRANSACTIONS on Information and Systems]]></source>
<year>2014</year>
<volume>97</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>3244&#8211;3247</page-range></nlm-citation>
</ref>
<ref id="B36">
<label>36</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lorensen]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Cline]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Marching cubes: A high resolution 3D surface construction algorithm]]></article-title>
<source><![CDATA[ACM Computer Graphics]]></source>
<year>1987</year>
<volume>21</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>163&#8211; 169</page-range></nlm-citation>
</ref>
<ref id="B37">
<label>37</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Martínez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Pla]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Vigo]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Skeletal representations of orthogonal shapes]]></article-title>
<source><![CDATA[Graphical Models]]></source>
<year>2013</year>
<volume>75</volume>
<page-range>189&#8211;207</page-range></nlm-citation>
</ref>
<ref id="B38">
<label>38</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Muuss]]></surname>
<given-names><![CDATA[M. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Butler]]></surname>
<given-names><![CDATA[L. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[State of the Art in Computer Graphics: Visualization and Modeling]]></source>
<year>1991</year>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B39">
<label>39</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Park]]></surname>
<given-names><![CDATA[S. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Choi]]></surname>
<given-names><![CDATA[B. K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Boundary extraction algorithm for cutting area detection]]></article-title>
<source><![CDATA[Computer-Aided Design]]></source>
<year>2001</year>
<volume>33</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>571&#8211; 579</page-range></nlm-citation>
</ref>
<ref id="B40">
<label>40</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Quadros]]></surname>
<given-names><![CDATA[W. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Shimada]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Owen]]></surname>
<given-names><![CDATA[S. J.]]></given-names>
</name>
</person-group>
<source><![CDATA[3D discrete skeleton generation by wave propagation on PR-octree for finite element mesh sizing]]></source>
<year>2004</year>
<conf-name><![CDATA[ Proceedings of ACM Symposium on Solid Modeling and Applications]]></conf-name>
<conf-loc> </conf-loc>
<page-range>327&#8211;332</page-range></nlm-citation>
</ref>
<ref id="B41">
<label>41</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Requicha]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Representations for rigid solids: Theory, methods and systems]]></article-title>
<source><![CDATA[ACM Computing Surveys]]></source>
<year>1980</year>
<volume>12</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>73&#8211;82</page-range></nlm-citation>
</ref>
<ref id="B42">
<label>42</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rodríguez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Ayala]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Fast neighbor-hood operations for images and volume data sets]]></article-title>
<source><![CDATA[Computers &amp; Graphics]]></source>
<year>2003</year>
<volume>27</volume>
<page-range>931&#8211;942</page-range></nlm-citation>
</ref>
<ref id="B43">
<label>43</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rodríguez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Ayala]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Aguilera]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[EVM: A Complete Solid Model for Surface Rendering]]></article-title>
<source><![CDATA[Geometric Modeling for Scientific Visualization]]></source>
<year>2004</year>
<page-range>259&#8211;274</page-range><publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B44">
<label>44</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rodríguez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Cruz]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Vergés]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Ayala]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A connected-component-labeling-based approach to virtual porosimetry]]></article-title>
<source><![CDATA[Graphical Models]]></source>
<year>2011</year>
<volume>73</volume>
<page-range>296&#8211;310</page-range></nlm-citation>
</ref>
<ref id="B45">
<label>45</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rosenfeld]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Pfaltz]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Sequential operations in digital picture processing]]></article-title>
<source><![CDATA[Journal of the ACM]]></source>
<year>1966</year>
<volume>13</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>471&#8211;494</page-range></nlm-citation>
</ref>
<ref id="B46">
<label>46</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Samet]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
</person-group>
<source><![CDATA[Applications of spatial data structures: Computer graphics, image processing, and GIS]]></source>
<year>1990</year>
<publisher-name><![CDATA[Addison-Wesley Longman Publishing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B47">
<label>47</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Samet]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Tamminen]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Bintrees, CSG trees, and time]]></source>
<year>1985</year>
<conf-name><![CDATA[ Proceedings of the 12th annual conference on Computer graphics and interactive techniques]]></conf-name>
<conf-loc> </conf-loc>
<page-range>121&#8211;130</page-range></nlm-citation>
</ref>
<ref id="B48">
<label>48</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Seidl]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Boden]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Fries]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Cc-mr&#8211;finding connected components in huge graphs with mapreduce]]></article-title>
<source><![CDATA[Machine Learning and Knowledge Discovery in Databases]]></source>
<year>2012</year>
<page-range>458&#8211;473</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B49">
<label>49</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Teschner]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Kimmerle]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Heidelberger]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Zachmann]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Raghupathi]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Fuhrmann]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Cani]]></surname>
<given-names><![CDATA[M.-P.]]></given-names>
</name>
<name>
<surname><![CDATA[Faure]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Magnenat-Thalmann]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Strasser]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Collision detection for deformable objects]]></article-title>
<source><![CDATA[Computer graphics forum]]></source>
<year>2005</year>
<volume>24</volume>
<page-range>61&#8211;81</page-range><publisher-name><![CDATA[Wiley Online Library]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B50">
<label>50</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Thibault]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Naylor]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Set operations on polyhedra using binary space partitioning trees]]></article-title>
<source><![CDATA[SIGGRAPH Comput. Graph.]]></source>
<year>1987</year>
<volume>21</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>153&#8211;162</page-range></nlm-citation>
</ref>
<ref id="B51">
<label>51</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Thurfjell]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Bengtsson]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Nordin]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A boundary approach to fast neighborhood oper-ations on three-dimensional binary data]]></article-title>
<source><![CDATA[CVGIP: Graphical Models and Image Processing]]></source>
<year>1995</year>
<volume>57</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>13&#8211;19</page-range></nlm-citation>
</ref>
<ref id="B52">
<label>52</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Udupa]]></surname>
<given-names><![CDATA[J. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Odhner]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Fast visualization, manipulation, and analysis of binary volumetric objects]]></article-title>
<source><![CDATA[IEEE Computer Graphics &amp; Applications]]></source>
<year>1991</year>
<page-range>53&#8211;62</page-range></nlm-citation>
</ref>
<ref id="B53">
<label>53</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Udupa]]></surname>
<given-names><![CDATA[J. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Odhner]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Shell rendering]]></article-title>
<source><![CDATA[IEEE Computer Graphics &amp; Applications]]></source>
<year>1993</year>
<page-range>58&#8211;67</page-range></nlm-citation>
</ref>
<ref id="B54">
<label>54</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vergés]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<source><![CDATA[Modeling, Analysis and Visualization of Porous Biomaterials]]></source>
<year>2011</year>
<publisher-name><![CDATA[LSI, Universitat Politècnica de Catalunya]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B55">
<label>55</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vigo]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Pla]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Ayala]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Martínez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficient algorithms for boundary extraction of 2D and 3D orthogonal pseudomanifolds]]></article-title>
<source><![CDATA[Graphical Models]]></source>
<year>2012</year>
<volume>74</volume>
<page-range>61&#8211;74</page-range></nlm-citation>
</ref>
<ref id="B56">
<label>56</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vogiannou]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Moustakas]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Tzovaras]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Strintzis]]></surname>
<given-names><![CDATA[M. G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Enhancing bounding volumes using support plane mappings for collision detection]]></article-title>
<source><![CDATA[Computer Graphics Forum]]></source>
<year>2010</year>
<volume>29</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>1595&#8211;1604</page-range></nlm-citation>
</ref>
<ref id="B57">
<label>57</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wilhems]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Gelder]]></surname>
<given-names><![CDATA[A. V.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Octrees for faster isosurface generation]]></article-title>
<source><![CDATA[ACM Transactions on Graphics]]></source>
<year>1992</year>
<volume>11</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>201&#8211;227</page-range></nlm-citation>
</ref>
<ref id="B58">
<label>58</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wong]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Shih]]></surname>
<given-names><![CDATA[F. Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Su]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Thinning algorithms based on quadtree and octree representations]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2006</year>
<volume>176</volume>
<page-range>1379&#8211;1394</page-range></nlm-citation>
</ref>
<ref id="B59">
<label>59</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zachmann]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<source><![CDATA[Minimal hierarchical collision detection]]></source>
<year>2002</year>
<conf-name><![CDATA[ Proc. of the ACM Sym. on Virtual reality software and technology]]></conf-name>
<conf-loc> </conf-loc>
<page-range>121&#8211; 128</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
