The coursework begins...

Advertisemen

And it's by far larger and harder than the coursework in first year (unfortunately).

The overview seems simple enough:

• Implement a basic Convex Hull algorithm (UpperHull and LowerHull)
• Use the Convex Hull algorithm to pathfinding around a single polygon from a start point to end point
• Pathfinding from a start to mid to end point, around multiple polygons
• Implement the divide and conquer Convex Hull algorithm
• Use the DCHull implementation for the All-Furthest-Segments problem

And also the obvious - make a UI to display all the data.

started out this in Java, but the number of times I needed to sort something was high so I switched to C# so I could use LINQ and reduce the painful effort of sorting in Java.

The Convex Hull algorithm was relatively easy enough to implement, but on the other hand, the pathfinding was quite difficult. Quite glad I implemented this in a high level not a lower level like C++ which was my original plan. If I had to implement it in C++, it'd be easily to implement in C#, refactor, and then rewrite in C++.

Anyway I'm onto pathfinding with multiple polygons, I have a basic idea how to accomplish this - not sure if it will work though!

Advertisemen