证明了每一个无可分离三角形的几乎三角剖分图均存在一个2-连通支撑子图，其最大度至多3．并且，这一结果是最佳可能的。

In this paper we proved that every near triangulation without separating triangles has a 2-connected spanning subgraph of maximum degree at most 3 which is the best possible.

youdao

三角剖分是有限元网格划分的重要工具之一。本文将这一方法应用于装配图的消隐之中，并介绍其原理及实现步骤。

Triangulation is an important way of finite element mesh generation. In this paper, this way is introduced into hiding assembly drawing, the relating theory and steps are also discussed.

youdao