<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">477060935</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180405111400.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170330e19960301xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/BF01200258</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/BF01200258</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Krysl</subfield>
   <subfield code="D">Petr</subfield>
   <subfield code="u">Department of Structural Mechanics, Czech Technical University in Prague, Thákurova 7, 16608, Prague, Czech Republic</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Computational complexity of the advancing front triangulation</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Petr Krysl]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">An attempt to reduce the computational complexity of the advancing front triangulation is described. The method is first decomposed into subtasks, and the computational complexity is investigated separately for them. It is shown that a major subtask, namely the geometric ompatibility (mesh correctness) checks can be carried out with linear growth rate. The applied techniques include modified advancing front management, and a localization device in the form of a regular grid (stored as a hypermatrix). The other subtask (access to mesh control function) could not be made of linear computational complexity for all modes of mesh control (ad hoc and adaptive). While thead hoc gradation control yields an algorithm with ideal oveall computational complexity, the adaptive gradation control gives still a suboptimal complexity (of orderO(N logN)).</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag London Limited, 1996</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Advancing front triangulation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Computational complexity</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Engineering with Computers</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">12/1(1996-03-01), 16-22</subfield>
   <subfield code="x">0177-0667</subfield>
   <subfield code="q">12:1&lt;16</subfield>
   <subfield code="1">1996</subfield>
   <subfield code="2">12</subfield>
   <subfield code="o">366</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/BF01200258</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/BF01200258</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Krysl</subfield>
   <subfield code="D">Petr</subfield>
   <subfield code="u">Department of Structural Mechanics, Czech Technical University in Prague, Thákurova 7, 16608, Prague, Czech Republic</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Engineering with Computers</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">12/1(1996-03-01), 16-22</subfield>
   <subfield code="x">0177-0667</subfield>
   <subfield code="q">12:1&lt;16</subfield>
   <subfield code="1">1996</subfield>
   <subfield code="2">12</subfield>
   <subfield code="o">366</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
