Research paper
Sparse point cloud registration and aggregation with mesh‐based generalized iterative closest point
About this item
- Title
- Sparse point cloud registration and aggregation with mesh‐based generalized iterative closest point
- Content partner
- University of Canterbury Library
- Collection
- UC Research Repository
- Description
Accurate registration is critical for robotic mapping and simultaneous localization and mapping (SLAM). Sparse or non-uniform point clouds can be very challenging to register, even in ideal environments. Previous research by Holz et al. has developed a mesh-based extension to the popular generalized iterative closest point (GICP) algorithm, which can accurately register sparse clouds where unmodified GICP would fail. This paper builds on that work by expanding the comparison between the two a...
- Format
- Research paper
- Research format
- Journal article
- Date created
- 2021
- Creator
- Young M / McCulloch J / Green R / Pretty, Christopher
- URL
- https://hdl.handle.net/10092/102808
- Related subjects
- PCL / sparse point cloud / GICP / registration / Artificial Intelligence and Image Processing / Electrical and Electronic Engineering / Mechanical Engineering / Engineering / Control engineering, mechatronics and robotics / Automation engineering / Field robotics / Information and computing sciences / Applied computing / Spatial data and applications / Theory of computation / Data structures and algorithms
What can I do with this item?
Check copyright status and what you can do with this item
Check informationReport this item
If you believe this item breaches our terms of use please report this item
Report this itemDigitalNZ brings together more than 30 million items from institutions so that they are easy to find and use. This information is the best information we could find on this item. This item was added on 25 October 2022, and updated 01 March 2025.
Learn more about how we work.
Share
What is the copyright status of this item?

All Rights Reserved
This item is all rights reserved, which means you'll have to get permission from University of Canterbury Library before using it.

More Information
University of Canterbury Library has this to say about the rights status of this item:
All rights reserved unless otherwise stated
You can learn more about the rights status of this item at: http://hdl.handle.net/10092/17651
What can I do with this item?
You must always check with University of Canterbury Library to confirm the specific terms of use, but this is our understanding:

Non-infringing use
NZ Copyright law does not prevent every use of a copyright work. You should consider what you can and cannot do with a copyright work.

No sharing
You may not copy and/or share this item with others without further permission. This includes posting it on your blog, using it in a presentation, or any other public use.

No modifying
You are not allowed to adapt or remix this item into any other works.

No commercial use
You may not use this item commercially.
What can I do with this item?
Check copyright status and what you can do with this item
Check informationReport this item
If you believe this item breaches our terms of use please report this item
Report this itemDigitalNZ brings together more than 30 million items from institutions so that they are easy to find and use. This information is the best information we could find on this item. This item was added on 25 October 2022, and updated 01 March 2025.
Learn more about how we work.
Share
Related items
Loading...