Skip navigation
  •  Home
  • UDC 
    • Getting started
    • RUC Policies
    • FAQ
    • FAQ on Copyright
    • More information at INFOguias UDC
  • Browse 
    • Communities
    • Browse by:
    • Issue Date
    • Author
    • Title
    • Subject
  • Help
    • español
    • Gallegan
    • English
  • Login
  •  English 
    • Español
    • Galego
    • English
  
View Item 
  •   DSpace Home
  • Facultade de Informática
  • Investigación (FIC)
  • View Item
  •   DSpace Home
  • Facultade de Informática
  • Investigación (FIC)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Compact and indexed representation for LiDAR point clouds

Thumbnail
View/Open
Ladra_Susana_2022_Compact_indexed_representation_for_LiDAR_point_clouds.pdf (46.90Mb)
Use this link to cite
http://hdl.handle.net/2183/32253
Atribución 4.0 Internacional (CC BY 4.0)
Except where otherwise noted, this item's license is described as Atribución 4.0 Internacional (CC BY 4.0)
Collections
  • Investigación (FIC) [1683]
Metadata
Show full item record
Title
Compact and indexed representation for LiDAR point clouds
Author(s)
Ladra, Susana
Rodríguez Luaces, Miguel
Paramá, José R.
Silva-Coira, Fernando
Date
2022
Citation
Susana Ladra, Miguel R. Luaces, José R. Paramá & Fernando Silva-Coira (2022): Compact and indexed representation for LiDAR point clouds, Geo-spatial Information Science, DOI: 10.1080/10095020.2022.2121664
Abstract
[Abstract]: LiDAR devices are capable of acquiring clouds of 3D points reflecting any object around them, and adding additional attributes to each point such as color, position, time, etc. LiDAR datasets are usually large, and compressed data formats (e.g. LAZ) have been proposed over the years. These formats are capable of transparently decompressing portions of the data, but they are not focused on solving general queries over the data. In contrast to that traditional approach, a new recent research line focuses on designing data structures that combine compression and indexation, allowing directly querying the compressed data. Compression is used to fit the data structure in main memory all the time, thus getting rid of disk accesses, and indexation is used to query the compressed data as fast as querying the uncompressed data. In this paper, we present the first data structure capable of losslessly compressing point clouds that have attributes and jointly indexing all three dimensions of space and attribute values. Our method is able to run range queries and attribute queries up to 100 times faster than previous methods.
Keywords
3D point clouds
Lossless compression
Indexing
 
Editor version
https://doi.org/10.1080/10095020.2022.2121664
Rights
Atribución 4.0 Internacional (CC BY 4.0)

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsResearch GroupAcademic DegreeThis CollectionBy Issue DateAuthorsTitlesSubjectsResearch GroupAcademic Degree

My Account

LoginRegister

Statistics

View Usage Statistics
Sherpa
OpenArchives
OAIster
Scholar Google
UNIVERSIDADE DA CORUÑA. Servizo de Biblioteca.    DSpace Software Copyright © 2002-2013 Duraspace - Send Feedback