top of page


N-dimensional Path Finder

Dilan Karaguler, Yangxiao Luo


Algorithm that is able to explore the twisty-ness and "volume" of higher dimensional space but is able to do so with minimal amount of data points using a smart, ML way to detect boundaries (CNN with 0-value infill and kNN infill). This algorithm has wide application in data exploration where you have some criteria or in and out of bounds. This has potential application in nuclear fusion, control theory, and many other boundary type and optimization problems.

Screen Shot 2022-06-03 at 11.31.35 AM.png
github URL
bottom of page