his.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Delaunay-Based Triangular Surface Reconstruction from Points via Umbrella Facet Matching
Department of Mechanical Engineering, University of British Columbia, Vancouver, BC V6T 1Z4, Canada.
Department of Mechanical Engineering, University of British Columbia, Vancouver, BC V6T 1Z4, Canada.
University of Skövde, The Virtual Systems Research Centre. University of Skövde, School of Technology and Society.
2010 (English)In: Proceedings of the 6th IEEE Conference on Automation Science and Engineering, IEEE conference proceedings, 2010, 580-585 p.Conference paper, (Refereed)
Abstract [en]

This  paper  presents  an  effective  algorithm  to reconstruct  a  closed  3D  triangular  surface  mesh  from  a  set of unorganized points based on Delaunay triangles. The algorithm essentially  seeks  to  construct  an  optimal  local  2D  manifold surface  (umbrella)  at  each  individual  point  in  parallel.  The underlying principle is that for any point, there always exists a cluster of triangular facets, selected from the Delaunay triangles at the point, to constitute the shape of an opened umbrella. If a triangular  facet  belongs  to  all  three  umbrellas  of  its  three vertices,  the  triangular  facet  is  considered  as a  matched  facet. When all triangular facets of an umbrella are matched facets, the  umbrella  is  regarded  as  a  matched  umbrella  which  fully overlaps with its neighboring umbrellas. A topologically correct triangular surface mesh is then constructed when the matched umbrella  for  every  individual  point  is  found.  The  proposed Umbrella    Facet    Matching    (UFM)    algorithm    has    been implemented and validated using many publicly available point cloud data sets. The algorithm is seen to be of good convergence and  without  the  need  for  further  hole-filling  post-processing. And the reconstructed surface meshes only contain minor shape approximation errors, when compared to the original surfaces of the sampled points.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2010. 580-585 p.
National Category
Engineering and Technology
Research subject
Technology
Identifiers
URN: urn:nbn:se:his:diva-4534DOI: 10.1109/COASE.2010.5584049Scopus ID: 2-s2.0-78149458908ISBN: 978-1-4244-5448-8 ISBN: 978-1-4244-5447-1 OAI: oai:DiVA.org:his-4534DiVA: diva2:383290
Conference
2010 IEEE International Conference on Automation Science and Engineering, CASE 2010; Toronto, ON; 21 August 2010 through 24 August 2010
Available from: 2011-01-04 Created: 2011-01-04 Last updated: 2013-09-09Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Wang, Lihui
By organisation
The Virtual Systems Research CentreSchool of Technology and Society
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 325 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf