Abstract
The triangulated irregular network (TIN) clipping algorithm is one of the vital algorithms for the digital mining design of opencast coal mines based on the geological digital elevation model (DEM) described by TIN. This paper gives a precise TIN clipping algorithm applied in the digital mining design of the opencast coal mine. To improve the algorithm's efficiency, a spatial grid index is built and utilized to embed the Clipping Polygon (CP) into the Clipped TIN (CTIN) by interpolating the CP's vertices' elevation and solving the intersections of the CP and the CTIN. After that, the topology of the triangles situated within (outside of) the CP is reconstructed, and then the boundary polygon of those triangles is obtained based on the reconstructed topology. Finally, a new boundary TIN between the CP and the boundary polygon of the triangles situated within (outside of) the CP is generated by applying the one-time edge-prior constrained Delaunay triangulation (CDT) growth algorithm, and the TIN to be clipped out is separated from the CTIN by topology modification. At that point, CTIN clipping is accomplished with the local details remaining. The algorithm has been programmed in C# and.NET. Additionally, it is also applied to the opencast coal mine digital mining design practice, and it is robust and highly efficient.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
