Development of an Algorithm for Random Packing of Multi-Sized Spherical Particles
Abstract A new computational algorithm is introduced for packing simulation of spherical elements/particles into an imaginary container with three main possible geometries, cubic, cylindrical and spherical. The performance of the algorithm depends directly on the strategy or logic considered to solv...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
de la Garza-Gutiérrez, H. [verfasserIn] Plascencia-Barrera, G. [verfasserIn] de la Torre, S. D. [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2010 |
|---|
| Übergeordnetes Werk: |
Enthalten in: MRS online proceedings library - Warrendale, Pa. : MRS, 1998, 1276(2010), 1 vom: Dez. |
|---|---|
| Übergeordnetes Werk: |
volume:1276 ; year:2010 ; number:1 ; month:12 |
| Links: |
|---|
| DOI / URN: |
10.1557/PROC-1276-5 |
|---|
| Katalog-ID: |
SPR04294967X |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | SPR04294967X | ||
| 003 | DE-627 | ||
| 005 | 20220112053736.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 210131s2010 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1557/PROC-1276-5 |2 doi | |
| 035 | |a (DE-627)SPR04294967X | ||
| 035 | |a (DE-599)SPRPROC-1276-5-e | ||
| 035 | |a (SPR)PROC-1276-5-e | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 670 |q ASE |
| 100 | 1 | |a de la Garza-Gutiérrez, H. |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Development of an Algorithm for Random Packing of Multi-Sized Spherical Particles |
| 264 | 1 | |c 2010 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a Abstract A new computational algorithm is introduced for packing simulation of spherical elements/particles into an imaginary container with three main possible geometries, cubic, cylindrical and spherical. The performance of the algorithm depends directly on the strategy or logic considered to solve the problem and the quality of its computational implementation. The combination of these two factors let the packing algorithm here presented and named as Octant Packing Random Algorithm (OPRA) to reduce the computation time between 2 and 127 times, when compared with the simplest or classical Packing Algorithm. OPRA is designed to reduce the number of comparisons needed to accept or reject a new position for an element/particle to be allocated into the virtual container. OPRA considers the container as if it were divided into 8 equal cells or octants limiting the overlap detection for a new position. | ||
| 700 | 1 | |a Plascencia-Barrera, G. |e verfasserin |4 aut | |
| 700 | 1 | |a de la Torre, S. D. |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t MRS online proceedings library |d Warrendale, Pa. : MRS, 1998 |g 1276(2010), 1 vom: Dez. |w (DE-627)57782046X |w (DE-600)2451008-7 |x 1946-4274 |7 nnns |
| 773 | 1 | 8 | |g volume:1276 |g year:2010 |g number:1 |g month:12 |
| 856 | 4 | 0 | |u https://dx.doi.org/10.1557/PROC-1276-5 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_SPRINGER | ||
| 912 | |a GBV_ILN_2005 | ||
| 951 | |a AR | ||
| 952 | |d 1276 |j 2010 |e 1 |c 12 | ||
| author_variant |
l g g h d lggh lgghd g p b gpb l t s d d ltsd ltsdd |
|---|---|
| matchkey_str |
article:19464274:2010----::eeomnoaagrtmornopcigfutsz |
| hierarchy_sort_str |
2010 |
| publishDate |
2010 |
| allfields |
10.1557/PROC-1276-5 doi (DE-627)SPR04294967X (DE-599)SPRPROC-1276-5-e (SPR)PROC-1276-5-e DE-627 ger DE-627 rakwb eng 670 ASE de la Garza-Gutiérrez, H. verfasserin aut Development of an Algorithm for Random Packing of Multi-Sized Spherical Particles 2010 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract A new computational algorithm is introduced for packing simulation of spherical elements/particles into an imaginary container with three main possible geometries, cubic, cylindrical and spherical. The performance of the algorithm depends directly on the strategy or logic considered to solve the problem and the quality of its computational implementation. The combination of these two factors let the packing algorithm here presented and named as Octant Packing Random Algorithm (OPRA) to reduce the computation time between 2 and 127 times, when compared with the simplest or classical Packing Algorithm. OPRA is designed to reduce the number of comparisons needed to accept or reject a new position for an element/particle to be allocated into the virtual container. OPRA considers the container as if it were divided into 8 equal cells or octants limiting the overlap detection for a new position. Plascencia-Barrera, G. verfasserin aut de la Torre, S. D. verfasserin aut Enthalten in MRS online proceedings library Warrendale, Pa. : MRS, 1998 1276(2010), 1 vom: Dez. (DE-627)57782046X (DE-600)2451008-7 1946-4274 nnns volume:1276 year:2010 number:1 month:12 https://dx.doi.org/10.1557/PROC-1276-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_2005 AR 1276 2010 1 12 |
| spelling |
10.1557/PROC-1276-5 doi (DE-627)SPR04294967X (DE-599)SPRPROC-1276-5-e (SPR)PROC-1276-5-e DE-627 ger DE-627 rakwb eng 670 ASE de la Garza-Gutiérrez, H. verfasserin aut Development of an Algorithm for Random Packing of Multi-Sized Spherical Particles 2010 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract A new computational algorithm is introduced for packing simulation of spherical elements/particles into an imaginary container with three main possible geometries, cubic, cylindrical and spherical. The performance of the algorithm depends directly on the strategy or logic considered to solve the problem and the quality of its computational implementation. The combination of these two factors let the packing algorithm here presented and named as Octant Packing Random Algorithm (OPRA) to reduce the computation time between 2 and 127 times, when compared with the simplest or classical Packing Algorithm. OPRA is designed to reduce the number of comparisons needed to accept or reject a new position for an element/particle to be allocated into the virtual container. OPRA considers the container as if it were divided into 8 equal cells or octants limiting the overlap detection for a new position. Plascencia-Barrera, G. verfasserin aut de la Torre, S. D. verfasserin aut Enthalten in MRS online proceedings library Warrendale, Pa. : MRS, 1998 1276(2010), 1 vom: Dez. (DE-627)57782046X (DE-600)2451008-7 1946-4274 nnns volume:1276 year:2010 number:1 month:12 https://dx.doi.org/10.1557/PROC-1276-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_2005 AR 1276 2010 1 12 |
| allfields_unstemmed |
10.1557/PROC-1276-5 doi (DE-627)SPR04294967X (DE-599)SPRPROC-1276-5-e (SPR)PROC-1276-5-e DE-627 ger DE-627 rakwb eng 670 ASE de la Garza-Gutiérrez, H. verfasserin aut Development of an Algorithm for Random Packing of Multi-Sized Spherical Particles 2010 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract A new computational algorithm is introduced for packing simulation of spherical elements/particles into an imaginary container with three main possible geometries, cubic, cylindrical and spherical. The performance of the algorithm depends directly on the strategy or logic considered to solve the problem and the quality of its computational implementation. The combination of these two factors let the packing algorithm here presented and named as Octant Packing Random Algorithm (OPRA) to reduce the computation time between 2 and 127 times, when compared with the simplest or classical Packing Algorithm. OPRA is designed to reduce the number of comparisons needed to accept or reject a new position for an element/particle to be allocated into the virtual container. OPRA considers the container as if it were divided into 8 equal cells or octants limiting the overlap detection for a new position. Plascencia-Barrera, G. verfasserin aut de la Torre, S. D. verfasserin aut Enthalten in MRS online proceedings library Warrendale, Pa. : MRS, 1998 1276(2010), 1 vom: Dez. (DE-627)57782046X (DE-600)2451008-7 1946-4274 nnns volume:1276 year:2010 number:1 month:12 https://dx.doi.org/10.1557/PROC-1276-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_2005 AR 1276 2010 1 12 |
| allfieldsGer |
10.1557/PROC-1276-5 doi (DE-627)SPR04294967X (DE-599)SPRPROC-1276-5-e (SPR)PROC-1276-5-e DE-627 ger DE-627 rakwb eng 670 ASE de la Garza-Gutiérrez, H. verfasserin aut Development of an Algorithm for Random Packing of Multi-Sized Spherical Particles 2010 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract A new computational algorithm is introduced for packing simulation of spherical elements/particles into an imaginary container with three main possible geometries, cubic, cylindrical and spherical. The performance of the algorithm depends directly on the strategy or logic considered to solve the problem and the quality of its computational implementation. The combination of these two factors let the packing algorithm here presented and named as Octant Packing Random Algorithm (OPRA) to reduce the computation time between 2 and 127 times, when compared with the simplest or classical Packing Algorithm. OPRA is designed to reduce the number of comparisons needed to accept or reject a new position for an element/particle to be allocated into the virtual container. OPRA considers the container as if it were divided into 8 equal cells or octants limiting the overlap detection for a new position. Plascencia-Barrera, G. verfasserin aut de la Torre, S. D. verfasserin aut Enthalten in MRS online proceedings library Warrendale, Pa. : MRS, 1998 1276(2010), 1 vom: Dez. (DE-627)57782046X (DE-600)2451008-7 1946-4274 nnns volume:1276 year:2010 number:1 month:12 https://dx.doi.org/10.1557/PROC-1276-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_2005 AR 1276 2010 1 12 |
| allfieldsSound |
10.1557/PROC-1276-5 doi (DE-627)SPR04294967X (DE-599)SPRPROC-1276-5-e (SPR)PROC-1276-5-e DE-627 ger DE-627 rakwb eng 670 ASE de la Garza-Gutiérrez, H. verfasserin aut Development of an Algorithm for Random Packing of Multi-Sized Spherical Particles 2010 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract A new computational algorithm is introduced for packing simulation of spherical elements/particles into an imaginary container with three main possible geometries, cubic, cylindrical and spherical. The performance of the algorithm depends directly on the strategy or logic considered to solve the problem and the quality of its computational implementation. The combination of these two factors let the packing algorithm here presented and named as Octant Packing Random Algorithm (OPRA) to reduce the computation time between 2 and 127 times, when compared with the simplest or classical Packing Algorithm. OPRA is designed to reduce the number of comparisons needed to accept or reject a new position for an element/particle to be allocated into the virtual container. OPRA considers the container as if it were divided into 8 equal cells or octants limiting the overlap detection for a new position. Plascencia-Barrera, G. verfasserin aut de la Torre, S. D. verfasserin aut Enthalten in MRS online proceedings library Warrendale, Pa. : MRS, 1998 1276(2010), 1 vom: Dez. (DE-627)57782046X (DE-600)2451008-7 1946-4274 nnns volume:1276 year:2010 number:1 month:12 https://dx.doi.org/10.1557/PROC-1276-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_2005 AR 1276 2010 1 12 |
| language |
English |
| source |
Enthalten in MRS online proceedings library 1276(2010), 1 vom: Dez. volume:1276 year:2010 number:1 month:12 |
| sourceStr |
Enthalten in MRS online proceedings library 1276(2010), 1 vom: Dez. volume:1276 year:2010 number:1 month:12 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| dewey-raw |
670 |
| isfreeaccess_bool |
false |
| container_title |
MRS online proceedings library |
| authorswithroles_txt_mv |
de la Garza-Gutiérrez, H. @@aut@@ Plascencia-Barrera, G. @@aut@@ de la Torre, S. D. @@aut@@ |
| publishDateDaySort_date |
2010-12-01T00:00:00Z |
| hierarchy_top_id |
57782046X |
| dewey-sort |
3670 |
| id |
SPR04294967X |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR04294967X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220112053736.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">210131s2010 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1557/PROC-1276-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR04294967X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)SPRPROC-1276-5-e</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)PROC-1276-5-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">670</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">de la Garza-Gutiérrez, H.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Development of an Algorithm for Random Packing of Multi-Sized Spherical Particles</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2010</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract A new computational algorithm is introduced for packing simulation of spherical elements/particles into an imaginary container with three main possible geometries, cubic, cylindrical and spherical. The performance of the algorithm depends directly on the strategy or logic considered to solve the problem and the quality of its computational implementation. The combination of these two factors let the packing algorithm here presented and named as Octant Packing Random Algorithm (OPRA) to reduce the computation time between 2 and 127 times, when compared with the simplest or classical Packing Algorithm. OPRA is designed to reduce the number of comparisons needed to accept or reject a new position for an element/particle to be allocated into the virtual container. OPRA considers the container as if it were divided into 8 equal cells or octants limiting the overlap detection for a new position.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Plascencia-Barrera, G.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">de la Torre, S. D.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">MRS online proceedings library</subfield><subfield code="d">Warrendale, Pa. : MRS, 1998</subfield><subfield code="g">1276(2010), 1 vom: Dez.</subfield><subfield code="w">(DE-627)57782046X</subfield><subfield code="w">(DE-600)2451008-7</subfield><subfield code="x">1946-4274</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:1276</subfield><subfield code="g">year:2010</subfield><subfield code="g">number:1</subfield><subfield code="g">month:12</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1557/PROC-1276-5</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">1276</subfield><subfield code="j">2010</subfield><subfield code="e">1</subfield><subfield code="c">12</subfield></datafield></record></collection>
|
| author |
de la Garza-Gutiérrez, H. |
| spellingShingle |
de la Garza-Gutiérrez, H. ddc 670 Development of an Algorithm for Random Packing of Multi-Sized Spherical Particles |
| authorStr |
de la Garza-Gutiérrez, H. |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)57782046X |
| format |
electronic Article |
| dewey-ones |
670 - Manufacturing |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
springer |
| remote_str |
true |
| illustrated |
Not Illustrated |
| issn |
1946-4274 |
| topic_title |
670 ASE Development of an Algorithm for Random Packing of Multi-Sized Spherical Particles |
| topic |
ddc 670 |
| topic_unstemmed |
ddc 670 |
| topic_browse |
ddc 670 |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| hierarchy_parent_title |
MRS online proceedings library |
| hierarchy_parent_id |
57782046X |
| dewey-tens |
670 - Manufacturing |
| hierarchy_top_title |
MRS online proceedings library |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)57782046X (DE-600)2451008-7 |
| title |
Development of an Algorithm for Random Packing of Multi-Sized Spherical Particles |
| ctrlnum |
(DE-627)SPR04294967X (DE-599)SPRPROC-1276-5-e (SPR)PROC-1276-5-e |
| title_full |
Development of an Algorithm for Random Packing of Multi-Sized Spherical Particles |
| author_sort |
de la Garza-Gutiérrez, H. |
| journal |
MRS online proceedings library |
| journalStr |
MRS online proceedings library |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
600 - Technology |
| recordtype |
marc |
| publishDateSort |
2010 |
| contenttype_str_mv |
txt |
| author_browse |
de la Garza-Gutiérrez, H. Plascencia-Barrera, G. de la Torre, S. D. |
| container_volume |
1276 |
| class |
670 ASE |
| format_se |
Elektronische Aufsätze |
| author-letter |
de la Garza-Gutiérrez, H. |
| doi_str_mv |
10.1557/PROC-1276-5 |
| dewey-full |
670 |
| author2-role |
verfasserin |
| title_sort |
development of an algorithm for random packing of multi-sized spherical particles |
| title_auth |
Development of an Algorithm for Random Packing of Multi-Sized Spherical Particles |
| abstract |
Abstract A new computational algorithm is introduced for packing simulation of spherical elements/particles into an imaginary container with three main possible geometries, cubic, cylindrical and spherical. The performance of the algorithm depends directly on the strategy or logic considered to solve the problem and the quality of its computational implementation. The combination of these two factors let the packing algorithm here presented and named as Octant Packing Random Algorithm (OPRA) to reduce the computation time between 2 and 127 times, when compared with the simplest or classical Packing Algorithm. OPRA is designed to reduce the number of comparisons needed to accept or reject a new position for an element/particle to be allocated into the virtual container. OPRA considers the container as if it were divided into 8 equal cells or octants limiting the overlap detection for a new position. |
| abstractGer |
Abstract A new computational algorithm is introduced for packing simulation of spherical elements/particles into an imaginary container with three main possible geometries, cubic, cylindrical and spherical. The performance of the algorithm depends directly on the strategy or logic considered to solve the problem and the quality of its computational implementation. The combination of these two factors let the packing algorithm here presented and named as Octant Packing Random Algorithm (OPRA) to reduce the computation time between 2 and 127 times, when compared with the simplest or classical Packing Algorithm. OPRA is designed to reduce the number of comparisons needed to accept or reject a new position for an element/particle to be allocated into the virtual container. OPRA considers the container as if it were divided into 8 equal cells or octants limiting the overlap detection for a new position. |
| abstract_unstemmed |
Abstract A new computational algorithm is introduced for packing simulation of spherical elements/particles into an imaginary container with three main possible geometries, cubic, cylindrical and spherical. The performance of the algorithm depends directly on the strategy or logic considered to solve the problem and the quality of its computational implementation. The combination of these two factors let the packing algorithm here presented and named as Octant Packing Random Algorithm (OPRA) to reduce the computation time between 2 and 127 times, when compared with the simplest or classical Packing Algorithm. OPRA is designed to reduce the number of comparisons needed to accept or reject a new position for an element/particle to be allocated into the virtual container. OPRA considers the container as if it were divided into 8 equal cells or octants limiting the overlap detection for a new position. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_2005 |
| container_issue |
1 |
| title_short |
Development of an Algorithm for Random Packing of Multi-Sized Spherical Particles |
| url |
https://dx.doi.org/10.1557/PROC-1276-5 |
| remote_bool |
true |
| author2 |
Plascencia-Barrera, G. de la Torre, S. D. |
| author2Str |
Plascencia-Barrera, G. de la Torre, S. D. |
| ppnlink |
57782046X |
| mediatype_str_mv |
c |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1557/PROC-1276-5 |
| up_date |
2024-07-03T15:45:45.431Z |
| _version_ |
1803573312023953408 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR04294967X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220112053736.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">210131s2010 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1557/PROC-1276-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR04294967X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)SPRPROC-1276-5-e</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)PROC-1276-5-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">670</subfield><subfield code="q">ASE</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">de la Garza-Gutiérrez, H.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Development of an Algorithm for Random Packing of Multi-Sized Spherical Particles</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2010</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract A new computational algorithm is introduced for packing simulation of spherical elements/particles into an imaginary container with three main possible geometries, cubic, cylindrical and spherical. The performance of the algorithm depends directly on the strategy or logic considered to solve the problem and the quality of its computational implementation. The combination of these two factors let the packing algorithm here presented and named as Octant Packing Random Algorithm (OPRA) to reduce the computation time between 2 and 127 times, when compared with the simplest or classical Packing Algorithm. OPRA is designed to reduce the number of comparisons needed to accept or reject a new position for an element/particle to be allocated into the virtual container. OPRA considers the container as if it were divided into 8 equal cells or octants limiting the overlap detection for a new position.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Plascencia-Barrera, G.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">de la Torre, S. D.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">MRS online proceedings library</subfield><subfield code="d">Warrendale, Pa. : MRS, 1998</subfield><subfield code="g">1276(2010), 1 vom: Dez.</subfield><subfield code="w">(DE-627)57782046X</subfield><subfield code="w">(DE-600)2451008-7</subfield><subfield code="x">1946-4274</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:1276</subfield><subfield code="g">year:2010</subfield><subfield code="g">number:1</subfield><subfield code="g">month:12</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1557/PROC-1276-5</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">1276</subfield><subfield code="j">2010</subfield><subfield code="e">1</subfield><subfield code="c">12</subfield></datafield></record></collection>
|
| score |
7.4017324 |