And, an alternative solution for rotating the object around for better reachability is also demonstrated.
而且,另一种解决方案,即通过旋转模型获得的可打印范围,也在本视频中有所演示。
英语百科
Reachability
In graph theory, reachability refers to the ability to get from one vertex to another within a graph. We say that a vertex can reach a vertex (or that is reachable from ) if there exists a sequence of adjacent vertices (i.e. a path) which starts with and ends with .