MathDB2 problems
Let the geodesic complexity of a convex polyhedron mean the minimum number of sets needed to cover its geodesic motion-planning problem, so that a complexity of at most four means…
Let the geodesic complexity of a convex polyhedron mean the minimum number of sets needed to cover its geodesic motion-planning problem, so that a complexity of at least four means…