IEEE Comput Graph Appl. 2021 May-Jun;41(3):85-95. doi: 10.1109/MCG.2021.3060946. Epub 2021 May 7.
We consider the problem of approximating given shapes so that the surface normals are restricted to a prescribed discrete set. Such shape approximations are commonly required in the context of manufacturing shapes. We provide an algorithm that first computes maximal interior polytopes and, then, selects a subset of offsets from the interior polytopes that cover the shape. This provides prescribed Hausdorff error approximations that use only a small number of primitives.
我们考虑这样一个问题，即如何逼近给定的形状，使得表面法向量限制在给定的离散集合中。在制造形状的背景下，通常需要这样的形状逼近。我们提供了一种算法，该算法首先计算最大内多胞体，然后从内多胞体中选择一个偏移量子集来覆盖形状。这提供了仅使用少量基元的规定的 Hausdorff 误差逼近。
