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
Repeated surface registration for on-line use
Luleå University of Technology, Department of Engineering Sciences and Mathematics, Mathematical Science.ORCID iD: 0000-0002-7566-3656
Luleå University of Technology, Department of Engineering Sciences and Mathematics, Mathematical Science.
Luleå University of Technology, Department of Engineering Sciences and Mathematics.ORCID iD: 0000-0003-3811-062X
2011 (English)In: The International Journal of Advanced Manufacturing Technology, ISSN 0268-3768, E-ISSN 1433-3015, Vol. 54, no 5-8, p. 677-689Article in journal (Refereed) Published
Abstract [en]

We consider the problem of matching sets of 3D points from a measured surface to the surface of a corresponding computer-aided design (CAD) object. The problem arises in the production line where the shape of the produced items is to be compared on-line with its pre-described shape. The involved registration problem is solved using the iterative closest point (ICP) method. In order to make it suitable for on-line use, i.e., make it fast, we pre-process the surface representation of the CAD object. A data structure for this purpose is proposed and named Distance Varying Grid tree. It is based on a regular grid that encloses points sampled from the CAD surfaces. Additional finer grids are added to the vertices in the grid that are close to the sampled points. The structure is efficient since it utilizes that the sampled points are distributed on surfaces, and it provides fast identification of the sampled point that is closest to a measured point. A local linear approximation of the surface is used for improving the accuracy. Experiments are done on items produced for the body of a car. The experiments show that it is possible to reach good accuracy in the registration and decreasing the computational time by a factor 700 compared with using the common kd-tree structure.

Place, publisher, year, edition, pages
2011. Vol. 54, no 5-8, p. 677-689
Keywords [en]
Manufacturing engineering and work sciences - Manufacturing engineering
Keywords [sv]
Produktion och arbetsvetenskap - Produktionsteknik
National Category
Computational Mathematics
Research subject
Scientific Computing
Identifiers
URN: urn:nbn:se:ltu:diva-10134DOI: 10.1007/s00170-010-2950-6ISI: 000290164500022Scopus ID: 2-s2.0-79955666988Local ID: 8e1867e0-d523-11df-8b36-000ea68e967bOAI: oai:DiVA.org:ltu-10134DiVA, id: diva2:983074
Note
Validerad; 2011; 20101011 (berper)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2018-07-10Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Bergström, PerEdlund, OveSöderkvist, Inge

Search in DiVA

By author/editor
Bergström, PerEdlund, OveSöderkvist, Inge
By organisation
Mathematical ScienceDepartment of Engineering Sciences and Mathematics
In the same journal
The International Journal of Advanced Manufacturing Technology
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 275 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