60528c5c2a
(rewrote the Dijkstra shortest path algorithm to use a binary priority heap instead of a dumb O(n^2) algorithm, added some bounding box tests to avoid expensive in-polygon tests if possible). |
||
---|---|---|
.. | ||
admesh | ||
eigen | ||
expat | ||
glew | ||
libslic3r | ||
poly2tri | ||
Shiny | ||
slic3r/GUI | ||
clipper.cpp | ||
clipper.hpp | ||
perlglue.cpp | ||
polypartition.cpp | ||
polypartition.h | ||
ppport.h | ||
xsinit.h |