http://debianws.lexgopc.com/wiki143/index.php?action=history&feed=atom&title=Cone_algorithm 2026-05-10T02:45:48Z Revision history for this page on the wiki MediaWiki 1.43.1 http://debianws.lexgopc.com/wiki143/index.php?title=Cone_algorithm&diff=7054069&oldid=prev 2024-03-24T06:34:23Z

<p><span class="autocomment">top: </span>Fixed typo</p> <p><b>New page</b></p><div>{{Short description|Computer algorithm}}<br /> In [[computational geometry]], the &#039;&#039;&#039;cone algorithm&#039;&#039;&#039; is an [[algorithm]] for identifying the particles that are near the surface of an object composed of discrete particles. Its applications include computational [[surface science]] and computational [[nanotechnology|nanoscience]]. The cone algorithm was first described in a publication about [[nanogold]] in 2005.<br /> <br /> The cone algorithm works well with clusters in condensed phases, including solid and liquid phases. It can handle the situations when one configuration includes multiple clusters or when holes exist inside clusters. It can also be applied to a cluster iteratively to identify multiple sub-surface layers.<br /> <br /> ==References==<br /> * Yanting Wang, S. Teitel, and [[Christoph Dellago]] (2005), [http://scitation.aip.org/getabs/servlet/GetabsServlet?prog=normal&amp;id=JCPSA6000122000021214722000001&amp;idtype=cvips&amp;gifs=yes Melting of Icosahedral Gold Nanoclusters from Molecular Dynamics Simulations]. &#039;&#039;Journal of Chemical Physics&#039;&#039; vol. 122, pp 214722–214738. {{doi|10.1063/1.1917756}}<br /> <br /> ==External links==<br /> *[http://www.pas.rochester.edu/~wangyt/algorithms/cone/index.html Cone Algorithm — Generic surface particle identification algorithm], Yanting Wang.<br /> <br /> [[Category:Molecular modelling software]]<br /> [[Category:Geometric algorithms]]<br /> <br /> <br /> {{molecular-modelling-software-stub}}</div>

imported>LucasBrown