A Method of Managing Perfectly-Balanced Trees for Solving Quickly the Nearest Point Problems

Hisashi SUZUKI; Suguru ARIMOTO

A Method of Managing Perfectly-Balanced Trees for Solving Quickly the Nearest Point Problems

Hisashi SUZUKI, Suguru ARIMOTO

Full Text Views

0

Cite this

Summary :

Let U denote a set comprising elements called "keys." The goal of the nearest point problem is to search quickly for a key among some keys x₁ , x_n that is the nearest to a reference key x under a partial order relation defined as (x, y) (x, z) for x, y, zU if d(x, y)d(x, z) given a wide-sense distance measure d. This article proposes a method of rearranging x₁ , x_n into a binary perfectly-balanced tree for solving quickly the nearest point problems. Further, computational performances of the proposed method are evaluated experimentally.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E76-A No.9 pp.1373-1382

Publication Date: 1993/09/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)

Category

Cite this

Copy

Hisashi SUZUKI, Suguru ARIMOTO, "A Method of Managing Perfectly-Balanced Trees for Solving Quickly the Nearest Point Problems" in IEICE TRANSACTIONS on Fundamentals, vol. E76-A, no. 9, pp. 1373-1382, September 1993, doi: .
Abstract: Let U denote a set comprising elements called "keys." The goal of the nearest point problem is to search quickly for a key among some keys x₁ , x_n that is the nearest to a reference key x under a partial order relation defined as (x, y) (x, z) for x, y, zU if d(x, y)d(x, z) given a wide-sense distance measure d. This article proposes a method of rearranging x₁ , x_n into a binary perfectly-balanced tree for solving quickly the nearest point problems. Further, computational performances of the proposed method are evaluated experimentally.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e76-a_9_1373/_p

Copy

@ARTICLE{e76-a_9_1373,
author={Hisashi SUZUKI, Suguru ARIMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Method of Managing Perfectly-Balanced Trees for Solving Quickly the Nearest Point Problems},
year={1993},
volume={E76-A},
number={9},
pages={1373-1382},
abstract={Let U denote a set comprising elements called "keys." The goal of the nearest point problem is to search quickly for a key among some keys x₁ , x_n that is the nearest to a reference key x under a partial order relation defined as (x, y) (x, z) for x, y, zU if d(x, y)d(x, z) given a wide-sense distance measure d. This article proposes a method of rearranging x₁ , x_n into a binary perfectly-balanced tree for solving quickly the nearest point problems. Further, computational performances of the proposed method are evaluated experimentally.},
keywords={},
doi={},
ISSN={},
month={September},}

Copy

TY - JOUR
TI - A Method of Managing Perfectly-Balanced Trees for Solving Quickly the Nearest Point Problems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1373
EP - 1382
AU - Hisashi SUZUKI
AU - Suguru ARIMOTO
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E76-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 1993
AB - Let U denote a set comprising elements called "keys." The goal of the nearest point problem is to search quickly for a key among some keys x₁ , x_n that is the nearest to a reference key x under a partial order relation defined as (x, y) (x, z) for x, y, zU if d(x, y)d(x, z) given a wide-sense distance measure d. This article proposes a method of rearranging x₁ , x_n into a binary perfectly-balanced tree for solving quickly the nearest point problems. Further, computational performances of the proposed method are evaluated experimentally.
ER -