I return seeking wisdom. I have been searching for a method of determining whether two clusters of points in 3D (~50 points per cluster) occupy an overlapping area. These points represent the atoms of a molecule, so the clusters can have very irregular shapes making bounding spheres/rectangles inaccurate. One method that seems promising is testing them for linear separability (i.e. if a plane can be placed between the two clusters). I do not need to know what the plane is, just whether one exists or not would be enough.
Has anyone encountered a problem similar to this? I have not had much luck finding resources online and my library lacks computational geometry books.
Any suggestions would be much appreciated! :)
In reply to Confused about 3D geometry / algebra by tomdbs98
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |