2013
DOI: 10.1016/j.gmod.2012.09.002
|View full text |Cite
|
Sign up to set email alerts
|

Octree-based fusion for realtime 3D reconstruction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
85
0
1

Year Published

2015
2015
2020
2020

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 124 publications
(87 citation statements)
references
References 18 publications
1
85
0
1
Order By: Relevance
“…As we want to save distance field data so it can be used later for post-processing, motion planning, and Recent works have focused on extending TSDF fusion to larger scenes by compressing the distance field to avoid storing and iterating over empty space. Many have used hierarchal data structures such as octrees or KD-trees to store the TSDF [30,31]. However, these structures suffer from high complexity and complications with parallelism.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…As we want to save distance field data so it can be used later for post-processing, motion planning, and Recent works have focused on extending TSDF fusion to larger scenes by compressing the distance field to avoid storing and iterating over empty space. Many have used hierarchal data structures such as octrees or KD-trees to store the TSDF [30,31]. However, these structures suffer from high complexity and complications with parallelism.…”
Section: Related Workmentioning
confidence: 99%
“…Some works have either used octrees [24,30,31], or use a moving volume [12]. Neither of these approaches is desirable for our application.…”
Section: F the Dynamic Spatially-hashed Tsdfmentioning
confidence: 99%
“…Octrees are established in many fields and are often used to alleviate computational burdens. Recent work ( [7,22,27]) uses Octrees for range data integration to map the environment, but employs simple update rules to encompass newly seen data without any optimization whatsoever. For simulation problems these partitioning structures are usually of static auxiliary nature (e.g.…”
Section: Arxiv:160807411v1 [Cscv] 26 Aug 2016mentioning
confidence: 99%
“…In [15,16], the authors deal with spatially adaptive techniques for incompressible flow and state their surprise about the high accuracy of Octree-based mesh refinement even for smallscale structures. The works [7,22,27] use dynamic Octree-based representations to store scene geometry but do no conduct any elaborate schemes for the integration since their main interest is mapping and efficient storage/updates for large-scale problems. [9] introduces a data structure that includes a hierarchical partitioning where each cube uses a runlength encoding.…”
Section: Related Workmentioning
confidence: 99%
“…Researchers have proposed multidimensional data structures such as R-tree [5], Quadtree [6,7], and Octree [8], all of which enable efficient performance in data storage and searching systems. Quadtree is commonly used in the two-dimensional space, whereas Octree is more popular in the three-dimensional space common in many application systems.…”
Section: Introductionmentioning
confidence: 99%