<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="3.0" xml:lang="en">
<front>
<journal-meta>
<journal-id journal-id-type="publisher">ISPRS-Archives</journal-id>
<journal-title-group>
<journal-title>The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences</journal-title>
<abbrev-journal-title abbrev-type="publisher">ISPRS-Archives</abbrev-journal-title>
<abbrev-journal-title abbrev-type="nlm-ta">Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci.</abbrev-journal-title>
</journal-title-group>
<issn pub-type="epub">2194-9034</issn>
<publisher><publisher-name>Copernicus Publications</publisher-name>
<publisher-loc>Göttingen, Germany</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.5194/isprs-archives-XLVIII-1-W2-2023-1081-2023</article-id>
<title-group>
<article-title>FILLING GAPS BETWEEN MESHES OF TREE CROWN AND TREE TRUNK BASED ON BOUNDARY CONSTRAINTS AND COORDINATE PROJECTION FOR 3D TREE MODELLING</article-title>
</title-group>
<contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Wang</surname>
<given-names>W. X.</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Hong</surname>
<given-names>L. P.</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Huang</surname>
<given-names>H. S.</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Li</surname>
<given-names>X. M.</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Tang</surname>
<given-names>S. J.</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Guo</surname>
<given-names>R. Z.</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Xie</surname>
<given-names>L. F.</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
</contrib-group><aff id="aff1">
<label>1</label>
<addr-line>Research Institute for Smart Cities, School of Architecture and Urban Planning, Shenzhen University, 518060 Shenzhen, China</addr-line>
</aff>
<pub-date pub-type="epub">
<day>13</day>
<month>12</month>
<year>2023</year>
</pub-date>
<volume>XLVIII-1/W2-2023</volume>
<fpage>1081</fpage>
<lpage>1087</lpage>
<permissions>
<copyright-statement>Copyright: &#x000a9; 2023 W. X. Wang et al.</copyright-statement>
<copyright-year>2023</copyright-year>
<license license-type="open-access">
<license-p>This work is licensed under the Creative Commons Attribution 4.0 International License. To view a copy of this licence, visit <ext-link ext-link-type="uri"  xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link></license-p>
</license>
</permissions>
<self-uri xlink:href="https://isprs-archives.copernicus.org/articles/XLVIII-1-W2-2023/1081/2023/isprs-archives-XLVIII-1-W2-2023-1081-2023.html">This article is available from https://isprs-archives.copernicus.org/articles/XLVIII-1-W2-2023/1081/2023/isprs-archives-XLVIII-1-W2-2023-1081-2023.html</self-uri>
<self-uri xlink:href="https://isprs-archives.copernicus.org/articles/XLVIII-1-W2-2023/1081/2023/isprs-archives-XLVIII-1-W2-2023-1081-2023.pdf">The full text article is available as a PDF file from https://isprs-archives.copernicus.org/articles/XLVIII-1-W2-2023/1081/2023/isprs-archives-XLVIII-1-W2-2023-1081-2023.pdf</self-uri>
<abstract>
<p>In order to reconstruct high-quality 3D tree models, trunks and crowns could be reconstructed using appropriate methods separately and merged together. During this process, gaps will appear after tree models are spliced, which will affect the models&apos; topological connectivity and visual effects. In this paper, a gap-repair algorithm for tree mesh models based on boundary restriction and coordinates projection is proposed. The algorithm first extracts all the holes in the tree trunk meshes and crown meshes and matched them according to their relative positions. Then, the gaps in the tree meshes are identified. After that, based on the projection of the hole vertices from 3D space to 2D space, the relative positions of the hole vertices were determined, and vertex connection and surface addition were carried out to generate a 2-manifold patch. Finally, the patch was refined to keep its density of vertices similar to the surrounding meshes. Real 3D Tree meshes of different species were used to conduct experiments, and the quality of the repaired tree models are evaluated qualitatively and quantitatively. Experimental results revealed that the proposed algorithm could fill gaps in tree meshes quickly and effectively, so as to achieve the topology connection and smooth transition between the trunk and crown meshes.</p>
</abstract>
<counts><page-count count="7"/></counts>
</article-meta>
</front>
<body/>
<back>
</back>
</article>