Commit Graph

8 Commits

Author SHA1 Message Date
566a7fb15f Remove intersecting chains
Removed intersecting chains using a greedy method
Fixed issue where chains found after splitting partitions do not get checked for intersection
2025-05-17 17:11:17 -04:00
7e39c48d76 Fixed duplicate collinear edge bug 2025-05-17 16:05:10 -04:00
2ff86b88a4 Use maps for keeping track of partitions 2025-05-17 03:10:02 -04:00
9e010d3fe1 Added collinear vertex detection 2025-05-17 02:41:02 -04:00
0f430e7a31 Fixed monotone partioning and finished triangulation algorithm
Removed a lot of debug code
Added comments
Fixed partition monotone not setting the vertex after unlinking edges
Added some better java awt stuff
Added a method to copy meshes
2025-05-06 00:11:09 -04:00
510fcc7b7d Fixed bad sorting
Should now sort edges based on the correct cross product
Fixed support edge connecting to the wrong vertex
Added in some more checks
Draw shapes slightly more correctly?
2025-05-04 18:53:03 -04:00
d16041f977 Improve tessellation algorithm
Added new mesh class
Rewrite mesh algorithms to be less error prone
Make code more concise
Tried to add some documentation
Added half edge set
2025-05-04 00:04:22 -04:00
a1899a52b7 Initial commit for historical purposes 2025-05-02 00:29:08 -04:00