intersectiontests

Intro

Intersection tests concern two geometry objects which are moved by translations and rotations and determining when they intersect. The idea is to visually represent this. For example one of the objects could change color.

How efficient the intersection test is is very important. Tests comparing different intersection algorithms will be constructed to answer such questions. For example does removing the division from line segment intersection speed up the computation in a significant way?

Here is some of my theory on Intersection Tests and Basic Vector Calculus and Geometry. I want to implement tests to get different algorithms and variations of algorithms working. Where the points of contact occur can also be represented. Different algorithms have different ideas. There are intersection tests that do not need to know the point of contact.

More intersection tests will be added.

Source

Files

Makefile
boxOBBhalfspaceD2.h
boxOBBhalfspaceD2test.cpp
boxOBBhalfspaceD2test.h
circleD2.h
circleD2test.cpp
circleD2test.h
d2arrow.cpp
d2arrow.h
d2linesegment.cpp
d2linesegment.h
d2simplex.cpp
d2simplex.h
d2simplexSeparateAxis.cpp
d2simplexSeparateAxis.h
d2simplexintersection.cpp
d2simplexintersection.h
d2simplextest.cpp
d2simplextest.h
diskinttest.cpp
diskinttest.h
main.cpp
mehu02.h
menu01.cpp
menu01.h
menu02.cpp
planeinttest.cpp
planeinttest.h
planepointsurface.cpp
planepointsurface.h
test02.h

OBBhalfspaceD2_01.txt
circleD2testfile01.txt
cylindercylinder01.txt
cylindercylinder02.txt
diskdisk01.txt
diskplane01.txt
planes01.txt
projcompile.txt
temp.txt
testscript01.txt
testscript02.txt
unittestsreport.txt

Doxygen

main.cpp
Makefile
boxOBBhalfspaceD2
boxOBBhalfspaceD2test
circleD2
circleD2test
d2arrow
d2linesegment
d2simplex
d2simplexFill
d2simplexNormals
d2simplexOutline
d2simplexSeparateAxis
d2simplexintersection
d2simplextest
d2simplextestmenu01
diskinttest
planeinttest
planepointsurface
test02

Types of Intersection Tests Implemented

• Simplex to Simplex Intersection with Separate Axis - creates half spaces to see all the other simplex's points, implemented in 2D with triangles.
• Plane to Plane intersection.
• Plane and Disk.
• Disk and Disk.
• Circle and OBB intersection (2D).

Experiment

Cylinder-Cylinder intersection with some implementation, see diskinttest::test03(argc,argv). For the theory see Cylinder and Cylinder Intersection.

TODO

• Remove translate and rotate. Replace with matrix multiplication with homogeneous matrices.
  
• Prepare a simplex test to compare the times it takes to test for intersection of a large number of simplexes. The data needs to be in a file and read as different simplex to simplex tests need to operate on the same data.
• line segment to line segment intersection test. Let p1 p2 q1 q2 be changed by the used (direct entry and rotation about a point and translation), and have the line color change when an intersection occurs.
• Simplex to simplex intersection testing with line segment intersection