Efficient Algorithms for Real-Time Octree Motion

Yoshifumi KITAMURA; Andrew SMITH; Fumio KISHINO

Efficient Algorithms for Real-Time Octree Motion

Yoshifumi KITAMURA, Andrew SMITH, Fumio KISHINO

Full Text Views

0

Cite this

Summary :

This paper presents efficient algorithms for updating moving octrees with real-time performance. The first algorithm works for octrees undergoing both translation and rotation motion; it works efficiently by compacting source octrees into a smaller set of cubes (not necessarily standard octree cubes) as a precomputation step, and by using a fast, exact cube/cube intersection test between source octree cubas and target octree cubes. A parallel version of the algorithm is also described. Finally, the paper presents an efficient algorithm for the more limited case of octree translation only. Experimental results are given to show the efficiency of the algorithms in comparison to competing algorithms. In addition to being fast, the algorithms presented are also space efficient in that they can produce target octrees in the linear octree representation.

Publication: IEICE TRANSACTIONS on Information Vol.E78-D No.12 pp.1573-1580

Publication Date: 1995/12/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Machine Vision Applications)

Category

Cite this

Copy

Yoshifumi KITAMURA, Andrew SMITH, Fumio KISHINO, "Efficient Algorithms for Real-Time Octree Motion" in IEICE TRANSACTIONS on Information, vol. E78-D, no. 12, pp. 1573-1580, December 1995, doi: .
Abstract: This paper presents efficient algorithms for updating moving octrees with real-time performance. The first algorithm works for octrees undergoing both translation and rotation motion; it works efficiently by compacting source octrees into a smaller set of cubes (not necessarily standard octree cubes) as a precomputation step, and by using a fast, exact cube/cube intersection test between source octree cubas and target octree cubes. A parallel version of the algorithm is also described. Finally, the paper presents an efficient algorithm for the more limited case of octree translation only. Experimental results are given to show the efficiency of the algorithms in comparison to competing algorithms. In addition to being fast, the algorithms presented are also space efficient in that they can produce target octrees in the linear octree representation.
URL: https://global.ieice.org/en_transactions/information/10.1587/e78-d_12_1573/_p

Copy

@ARTICLE{e78-d_12_1573,
author={Yoshifumi KITAMURA, Andrew SMITH, Fumio KISHINO, },
journal={IEICE TRANSACTIONS on Information},
title={Efficient Algorithms for Real-Time Octree Motion},
year={1995},
volume={E78-D},
number={12},
pages={1573-1580},
abstract={This paper presents efficient algorithms for updating moving octrees with real-time performance. The first algorithm works for octrees undergoing both translation and rotation motion; it works efficiently by compacting source octrees into a smaller set of cubes (not necessarily standard octree cubes) as a precomputation step, and by using a fast, exact cube/cube intersection test between source octree cubas and target octree cubes. A parallel version of the algorithm is also described. Finally, the paper presents an efficient algorithm for the more limited case of octree translation only. Experimental results are given to show the efficiency of the algorithms in comparison to competing algorithms. In addition to being fast, the algorithms presented are also space efficient in that they can produce target octrees in the linear octree representation.},
keywords={},
doi={},
ISSN={},
month={December},}

Copy

TY - JOUR
TI - Efficient Algorithms for Real-Time Octree Motion
T2 - IEICE TRANSACTIONS on Information
SP - 1573
EP - 1580
AU - Yoshifumi KITAMURA
AU - Andrew SMITH
AU - Fumio KISHINO
PY - 1995
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E78-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 1995
AB - This paper presents efficient algorithms for updating moving octrees with real-time performance. The first algorithm works for octrees undergoing both translation and rotation motion; it works efficiently by compacting source octrees into a smaller set of cubes (not necessarily standard octree cubes) as a precomputation step, and by using a fast, exact cube/cube intersection test between source octree cubas and target octree cubes. A parallel version of the algorithm is also described. Finally, the paper presents an efficient algorithm for the more limited case of octree translation only. Experimental results are given to show the efficiency of the algorithms in comparison to competing algorithms. In addition to being fast, the algorithms presented are also space efficient in that they can produce target octrees in the linear octree representation.
ER -