期刊
COMPUTER GRAPHICS FORUM
卷 32, 期 5, 页码 157-166出版社
WILEY
DOI: 10.1111/cgf.12182
关键词
-
资金
- NSF [IIS-0846072]
- Div Of Information & Intelligent Systems
- Direct For Computer & Info Scie & Enginr [0846072] Funding Source: National Science Foundation
We present an algorithm for obtaining a triangulation of multiple, non-planar 3D polygons. The output minimizes additive weights, such as the total triangle areas or the total dihedral angles between adjacent triangles. Our algorithm generalizes a classical method for optimally triangulating a single polygon. The key novelty is a mechanism for avoiding non-manifold outputs for two and more input polygons without compromising optimality. For better performance on real-world data, we also propose an approximate solution by feeding the algorithm with a reduced set of triangles. In particular, we demonstrate experimentally that the triangles in the Delaunay tetrahedralization of the polygon vertices offer a reasonable trade off between performance and optimality.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据