Analysis of Interactive Editing Operations for Out-of-Core Point-Cloud Hierarchies

Claus Scheiblauer, Michael Wimmer
Analysis of Interactive Editing Operations for Out-of-Core Point-Cloud Hierarchies
In WSCG 2013 Full Paper Proceedings, pages 123-132. June 2013.
[paper]

Information

Abstract

In this paper we compare the time and space complexity of editing operations on two data structures which are suitable for visualizing huge point clouds. The first data structure was introduced by Scheiblauer and Wimmer [SW11] and uses only the original points from a source data set for building a level-of-detail hierarchy that can be used for rendering points clouds. The second data structure introduced by Wand et al. [WBB+07] requires additional points for the level-of-detail hierarchy and therefore needs more memory when stored on disk. Both data structures are based on an octree hierarchy and allow for deleting and inserting points. Besides analyzing and comparing these two data structures we also introduce an improvement to the points deleting algorithm for the data structure of Wand et al. [WBB+07], which thus allows for a more efficient node loading strategy during rendering.

Additional Files and Images

Additional images and videos

image: Stephansdom overdraw with MNO at 1px point size.

Additional files

paper: The submitted paper.

Weblinks

No further information available.

BibTeX

@inproceedings{scheiblauer-2013-wscg,
  title =      "Analysis of Interactive Editing Operations for Out-of-Core
               Point-Cloud Hierarchies",
  author =     "Claus Scheiblauer and Michael Wimmer",
  year =       "2013",
  abstract =   "In this paper we compare the time and space complexity of
               editing operations on two data structures which are suitable
               for visualizing huge point clouds. The first data structure
               was introduced by Scheiblauer and Wimmer [SW11] and uses
               only the original points from a source data set for building
               a level-of-detail hierarchy that can be used for rendering
               points clouds. The second data structure introduced by Wand
               et al. [WBB+07] requires additional points for the
               level-of-detail hierarchy and therefore needs more memory
               when stored on disk. Both data structures are based on an
               octree hierarchy and allow for deleting and inserting
               points. Besides analyzing and comparing these two data
               structures we also introduce an improvement to the points
               deleting algorithm for the data structure of Wand et al.
               [WBB+07], which thus allows for a more efficient node
               loading strategy during rendering.",
  month =      jun,
  booktitle =  "WSCG 2013 Full Paper Proceedings",
  editor =     "Vaclav Skala",
  isbn =       "978-80-86943-74-9",
  location =   "Plzen",
  publisher =  "Union Agency",
  pages =      "123--132",
  keywords =   "complexity analysis, point clouds, data structures, viewing
               algorithms",
  URL =        "https://www.cg.tuwien.ac.at/research/publications/2013/scheiblauer-2013-wscg/",
}