Optimization of triangulations based on serial fault data
Lists
Only you see this
Abstract
Three-dimensional reconstructions based on serial fault data can be divided into boundary contour splicing and end contour closure. In boundary contour splicing, the Delaunay triangulation algorithm can generate long, narrow triangles or radial shapes and with end contour closure, the Delaunay triangulation based on the determination of the convex-concave vertices tends to generate long, narrow triangles and triangles whose sizes differ greatly, and in some cases failure. This paper presents a Delaunay triangulation algorithm based on the shortest distance first principle for boundary contour splicing and an improved algorithm which combines Delaunay triangulation based on the determination of convex-concave vertices with interpolation for end contour closure. The results show that the algorithms retain the original advantages of the algorithms while increasing the triangulation effectiveness and enhancing the universality of the algorithms.
BibTeX
@inproceedings{yang2009optimization,
author = {Xiaodong Yang and Peng Liu},
title = {{Optimization of triangulations based on serial fault data}},
booktitle = {Tsinghua},
year = {2009},
doi = {10.1016/s1007-0214(09)70064-1},
}Loading related content...