<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">469072784</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180323132926.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170328e19921201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/BF02032463</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/BF02032463</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Peters</subfield>
   <subfield code="D">Thomas</subfield>
   <subfield code="u">Department of Computer Science and Engineering, University of Connecticut, 06269-3155, Storrs, CT, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Mechanical design heuristics to reduce the combinatorial complexity for feature recognition</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Thomas Peters]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Feature recognition can be characterized as enhancing the geometric database representation of a mechanical artifact to include some design intent. A number of feature recognition systems have successfully demonstrated the ability to capture such design knowledge. To determine if any such system could &quot;scale-up” to large industrial part databases, it is appropriate to analyze the computational complexity of the recognition system-an issue which appears to have generally been ignored by the feature recognition community. A naive combinatorial analysis, generally applicable over all design domains, suggests that the combinatorial complexity would be exponential, hence intractable within most modern computing environments. Such a theoretical mathematical analysis ignores critical domain-specific engineering knowledge. It is argued that this theoretical potential for combinatorial explosion can be addressed by combining domain-specific mechanical engineering heuristics with a detailed combinatorial analysis. An example of such a heuristically guided combinatorial analysis will be presented for the domain of sheet-metal parts. This example presents combinatorial upper bounds which indicate that feature recognition upon large sheet-metal databases will be computationally tractable. In order to extend the analysis to other domains, it may be necessary to develop other domain-specific heuristics. However, the example presented should serve as a guide to incorporating design heuristics with combinatorial analysis.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag New York Inc., 1993</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Research in Engineering Design</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">4/4(1992-12-01), 195-201</subfield>
   <subfield code="x">0934-9839</subfield>
   <subfield code="q">4:4&lt;195</subfield>
   <subfield code="1">1992</subfield>
   <subfield code="2">4</subfield>
   <subfield code="o">163</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/BF02032463</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/BF02032463</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">Peters</subfield>
   <subfield code="D">Thomas</subfield>
   <subfield code="u">Department of Computer Science and Engineering, University of Connecticut, 06269-3155, Storrs, CT, USA</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">Research in Engineering Design</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">4/4(1992-12-01), 195-201</subfield>
   <subfield code="x">0934-9839</subfield>
   <subfield code="q">4:4&lt;195</subfield>
   <subfield code="1">1992</subfield>
   <subfield code="2">4</subfield>
   <subfield code="o">163</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>
