一种改进的不规则三角网格曲面切割算法

花卫华; 邓伟萍; 刘修国; 尚建嘎

Volume 31 Issue 5

Sep. 2006

Turn off MathJax

Article Contents

Article Navigation > Earth Science > 2006 > 31(5): 619-623

HUA Wei-hua, DENG Wei-ping, LIU Xiu-guo, SHANG Jian-ga, 2006. Improved Partition Algorithm between Triangulated Irregular Network. Earth Science, 31(5): 619-623.

Citation:

HUA Wei-hua, DENG Wei-ping, LIU Xiu-guo, SHANG Jian-ga, 2006. Improved Partition Algorithm between Triangulated Irregular Network. Earth Science, 31(5): 619-623.

HUA Wei-hua, DENG Wei-ping, LIU Xiu-guo, SHANG Jian-ga, 2006. Improved Partition Algorithm between Triangulated Irregular Network. Earth Science, 31(5): 619-623.

Citation:

HUA Wei-hua, DENG Wei-ping, LIU Xiu-guo, SHANG Jian-ga, 2006. Improved Partition Algorithm between Triangulated Irregular Network. Earth Science, 31(5): 619-623.

PDF( 219 KB)

Improved Partition Algorithm between Triangulated Irregular Network

HUA Wei-hua^{1, 2
,},
DENG Wei-ping³,
LIU Xiu-guo^{1, 2},
SHANG Jian-ga^{1, 2}

1.
Faculty of In for mation Engineering, China University of Geosciences, Wuhan 430074, China
2.
Wuhan Zondy Cyber-Tech Co., Ltd., Wuhan 430074, China
3.
Faculty of Computer Science, Hubei University of Economics, Wuhan 430000, China

Received Date: 2006-05-30
Publish Date: 2006-09-25

Abstract

Abstract

The partition algorithms between triangulated irregular network are key algorithms for building and analyzing 3D geology models. Their efficiency determines the model building efficiency. To improve the algorithm, this paper first realizes collision detection by building OBB (oriented-bounding box) trees, and then calculates the intersection points of cutting triangle pairs. Through normalizing the vertex coordinates, the algorithm provides a method for the rapid reconstruction of the geology model. The algorithm uses different partition methods based on different partition types. This paper gives a detailed description of the algorithm's process and demonstrates a cut effect of triangulated irregular network.
- TIN,
- intesection,
- OBBT,
- normalization,
- partition,
- projection

FullText(HTML)

References(10)

References

Ding, Y. X., Xia, J. C., Wang, Y., et al., 1994. Arbitrary polygon delaunay triangulation. Joural of Computer, 17 (4): 270 -275 (in Chinese with English abstract).

Gottschalk, S. G., Lin, M., 1996. OBB tree: A hierarchical structure for rapid interference. ACM Siggraph' 96, [s. n. ]. 171 -180.

Lindenbeck, C. H., 2002. A program to clip triangle meshes using the rapid and triangle libraries and the visualization toolkit. Computers & Geosciences, 28: 841 -850.

Paul, B., 1989. Intersection point of two lines (2 dimensions). http://local.wasp.uwa.edu.au.

Ren, J. B., 2005. Irregular triangulation based on plane polygon. Journal of Gansu Sciences, 17 (1): 65 -68 (in Chi-nese with English abstract).

Tomas, M., 1997. A fast triangle-triangle intersection test. Journal of Graphics Tools, 2 (2): 1 -5. doi: 10.1080/10867651.1997.10487470

Yang, J., 2000. Simple polygon triangulation based on scraggy vertex determinant. Minitype Computer System, 21 (9): 974 -975 (in Chinese with English abstract).

丁永祥, 夏巨谌, 王英, 等, 1994. 任意多边形的Delaunay三角剖分. 计算机学报, 17 (4): 270 -275. https://www.cnki.com.cn/Article/CJFDTOTAL-JSJX404.004.htm

任建波, 2005. 基于平面多边形的不规则三角网分割. 甘肃科学学报, 17 (1): 65 -68. doi: 10.3969/j.issn.1004-0366.2005.01.018

杨杰, 2000. 基于凸凹顶点判定的简单多边形的三角剖分. 小型微型计算机系统, 21 (9): 974 -975. doi: 10.3969/j.issn.1000-1220.2000.09.022

Relative Articles

Supplements(0)

Cited By

Proportional views