Programming Portfolio
Under Construction
This portfolio is a work in progress. There is no ETA.
With roughly 25 projects to present and discuss it may take some time.
Orthanc Filter
2022
The plugin allows medical researchers to configure a json file, housed by a system running the Orthanc server software, in order to specify which DICOM data to erase and what dates to truncate and how to truncate them. There are additional settings that can be utilized in order to control the organization of files on the storage medium.
Hypermaze
2016
The maze is generated by expanding from a given node, so it needs to be given a root node. The root node is put onto a double ended queue just before the algorithm’s main loop. Inside the loop the algorithm takes the previous generation of nodes out of the queue, one at a time, and expands from them.
Word Search with Threads
2015
Designing an algorithm to solve word search puzzles is not exactly a difficult task. As any good programmer knows, however, an easy or simple solution isn’t always a good one. After all, the easy solution could be wasting valuable CPU cycles. Luckily for a word search, the only guaranteed place cycles can be wasted – in any given algorithm – is in comparing words against strings too small to contain the word.
Rover Recursive Pathfinding
2014
For an algorithm to be considered recursive its code must be recursive, doing recursive things doesn’t cut it. What I mean is that finding nested data is a recursive action, because the data is literally contained within other data you are searching recursively in order to find more data; however that isn’t recursive code, which I thought was odd at first. Recursive code, in general, is recursive because the code will execute itself. The call stack is what’s recursive here, and with that in mind the separation between doing something recursively and being recursive makes total sense.
Cheryl Engine
2014
This project was about making a version 2 of my Cheryl-Engine. Up to this point the engine was merely Blit3D with a couple optimizations and numerous component rewrites. So I wanted to try my hand at designing an engine from the ground up.
The engine is designed with modularity in mind. I decided to separate it into three distinct libraries: glEngine, AssetFaculties, and GameFramework…
A* Pathfinding
2013
An Introduction The A* algorithm is a best-first search, which means it aims to find the cheapest path to the goal. To do this it relies on the problem space being represented as a weighted graph – a common practice in computer science fields. From a starting graph A* originates at the start node and […]
