arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0911.3420math-phcond-mat.softmath.MP
收藏

二维任意硬椭圆的最近距离

Distance of closest approach of two arbitrary hard ellipses in 2D

Xiaoyu Zheng, Peter Palffy-Muhoray

摘要:

硬颗粒的最接近距离是它们相互作用的关键参数,并且在所产生的相行为中起重要作用。对于非球形粒子,最近接近距离取决于取向,并且其计算令人惊讶地困难。虽然重叠标准已被开发用于计算机模拟[1,2],没有解析解已获得的距离最近的方法的椭圆体在3-D,或到目前为止,在2-D的椭圆。本文导出了两个任意硬椭圆的圆心最近距离的解析表达式,它是两个硬椭圆相对于圆心连线的方位的函数。我们描述了我们的方法来解决这个问题,说明我们的结果,并讨论它的有用性在建模和模拟系统的不等轴颗粒,如液晶。

英文摘要:

The distance of closest approach of hard particles is a key parameter of their interaction and plays an important role in the resulting phase behavior. For non-spherical particles, the distance of closest approach depends on orientation, and its calculation is surprisingly difficult. Although overlap criteria have been developed for use in computer simulations [1, 2], no analytic solutions have been obtained for the distance of closest approach of ellipsoids in 3-D, or, until now, for ellipses in 2-D. We have derived an analytic expression for the distance of closest approach of the centers of two arbitrary hard ellipses as function of their orientation relative to the line joining their centers. We describe our method for solving this problem, illustrate our result, and discuss its usefulness in modeling and simulating systems of anisometric particles such as liquid crystals.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑