IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0281864.html
   My bibliography  Save this article

A precise TIN clipping algorithm for the digital mining design of the opencast coal mine

Author

Listed:
  • Jingchang Zhao
  • Xiangbo Wang
  • Dong Wang
  • Guangwei Liu

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.

Suggested Citation

  • Jingchang Zhao & Xiangbo Wang & Dong Wang & Guangwei Liu, 2023. "A precise TIN clipping algorithm for the digital mining design of the opencast coal mine," PLOS ONE, Public Library of Science, vol. 18(2), pages 1-18, February.
    • Handle: RePEc:plo:pone00:0281864
    DOI: 10.1371/journal.pone.0281864
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0281864
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0281864&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0281864?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0281864. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.