Editing 3-dimensional hard rods

Jump to navigation Jump to search
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.

Latest revision Your text
Line 1: Line 1:
'''3-dimensional hard rods''' are line segments that are unable to intersect. The can also be considered to be a limiting case of the [[Hard spherocylinders | hard spherocylinder model]] whose diameter is zero.  
'''3-dimensional hard rods''' are line segments that are unable to intersect. The can also be considered to be a limiting case of the [[Hard spherocylinders | hard spherocylinder model]] whose diameter is zero.  
==Minimum distance==
==Minimum distance==
The minimum distance between two hard rods in three dimensions can be calculated using an algorithm published by Vega and Lago (Ref. 1). The [[Source code for the minimum distance between two rods | source code can be found here]]. Such an algorithm is essential in, for example, a [[Monte Carlo]] simulation, in order to check for overlaps between two sites.
*[http://dx.doi.org/10.1016/0097-8485(94)80023-5  Carlos Vega and Santiago Lago "A fast algorithm to evaluate the shortest distance between rods", Computers & Chemistry  '''18''' pp. 55-59 (1994)]
#[http://dx.doi.org/10.1016/0097-8485(94)80023-5  Carlos Vega and Santiago Lago "A fast algorithm to evaluate the shortest distance between rods", Computers & Chemistry  '''18''' pp. 55-59 (1994)]
 
==Density-functional theory==
==Density-functional theory==
[[Density-functional theory]]
[[Density-functional theory]]
Please note that all contributions to SklogWiki are considered to be released under the Creative Commons Attribution Non-Commercial Share Alike (see SklogWiki:Copyrights for details). If you do not want your writing to be edited mercilessly and redistributed at will, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource. Do not submit copyrighted work without permission!

To edit this page, please answer the question that appears below (more info):

Cancel Editing help (opens in new window)