| Commit message (Collapse) | Author | Age | Lines | |
|---|---|---|---|---|
| * | Implement bounding box function | Arne Dußin | 2020-11-18 | -7/+13 |
| | | ||||
| * | Add intersection point algorithm | Arne Dußin | 2020-11-15 | -113/+111 |
| | | ||||
| * | Fix the polygon point containment algorithm | Arne Dußin | 2020-11-12 | -29/+82 |
| | | | | | | | | | The algorithm before was really not working for a lot of edge cases and very difficult to adapt. This version is definitely not the be-all and end-all, but it should work for most (well, hopefully all) cases. After refactoring and hopefully simplifying and straightening out the logic a little more, it should be verifiable. | |||
| * | Add polygon that can check if a point is inside | Arne Dußin | 2020-11-11 | -0/+112 |
| ..except for one super super edgy edge case, but I wanted to get this algorithm out into a commit before I ruin it completely (probably) | ||||
 |
index : graf_karto | |
| Dungeon mapping tool because clearly there are not enough out there! |
| aboutsummaryrefslogtreecommitdiff |