20 lines
1.2 KiB
Markdown
20 lines
1.2 KiB
Markdown
---
|
||
title: "Cone algorithm"
|
||
chunk: 1/1
|
||
source: "https://en.wikipedia.org/wiki/Cone_algorithm"
|
||
category: "reference"
|
||
tags: "science, encyclopedia"
|
||
date_saved: "2026-05-05T12:14:10.589680+00:00"
|
||
instance: "kb-cron"
|
||
---
|
||
|
||
In computational geometry, the cone algorithm 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 nanoscience. The cone algorithm was first described in a publication about nanogold in 2005.
|
||
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.
|
||
|
||
|
||
== References ==
|
||
Yanting Wang, S. Teitel, and Christoph Dellago (2005), Melting of Icosahedral Gold Nanoclusters from Molecular Dynamics Simulations. Journal of Chemical Physics vol. 122, pp 214722–214738. doi:10.1063/1.1917756
|
||
|
||
|
||
== External links ==
|
||
Cone Algorithm — Generic surface particle identification algorithm, Yanting Wang. |