STUDIA UNIV. BABES--BOLYAI, INFORMATICA, Volume XLVII, Number 2, 2002
In our everyday life we have to deal with di#erent problems that, in most cases, need new data structures. At first sight, these structures do not look like any known data structure. This paper presents a data structure wehave called "fringed-quadtree". This structure is a tree with nodes...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Text |
Language: | English |
Published: |
2002
|
Subjects: | |
Online Access: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.4002 http://www.cs.ubbcluj.ro/~studia-i/2002-2/10-Ionescu.pdf |
id |
ftciteseerx:oai:CiteSeerX.psu:10.1.1.8.4002 |
---|---|
record_format |
openpolar |
spelling |
ftciteseerx:oai:CiteSeerX.psu:10.1.1.8.4002 2023-05-15T18:32:39+02:00 STUDIA UNIV. BABES--BOLYAI, INFORMATICA, Volume XLVII, Number 2, 2002 Fringed-Quadtrees New Kind Clara Ionescu The Pennsylvania State University CiteSeerX Archives 2002 application/pdf http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.4002 http://www.cs.ubbcluj.ro/~studia-i/2002-2/10-Ionescu.pdf en eng http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.4002 http://www.cs.ubbcluj.ro/~studia-i/2002-2/10-Ionescu.pdf Metadata may be used without restrictions as long as the oai identifier remains attached to it. http://www.cs.ubbcluj.ro/~studia-i/2002-2/10-Ionescu.pdf text 2002 ftciteseerx 2016-01-08T19:16:28Z In our everyday life we have to deal with di#erent problems that, in most cases, need new data structures. At first sight, these structures do not look like any known data structure. This paper presents a data structure wehave called "fringed-quadtree". This structure is a tree with nodes that may be roots or leaves. A root-node may have at most four leaves. These trees may be built considering some rules that are presented in the paper. Due to the specific queries, the pointers will be ascending for the root-nodes and descending for the leaves. The time complexity of the described algorithms is logarithmic or linear and the memory space needed has the order O(n). Text The Pointers Unknown |
institution |
Open Polar |
collection |
Unknown |
op_collection_id |
ftciteseerx |
language |
English |
description |
In our everyday life we have to deal with di#erent problems that, in most cases, need new data structures. At first sight, these structures do not look like any known data structure. This paper presents a data structure wehave called "fringed-quadtree". This structure is a tree with nodes that may be roots or leaves. A root-node may have at most four leaves. These trees may be built considering some rules that are presented in the paper. Due to the specific queries, the pointers will be ascending for the root-nodes and descending for the leaves. The time complexity of the described algorithms is logarithmic or linear and the memory space needed has the order O(n). |
author2 |
The Pennsylvania State University CiteSeerX Archives |
format |
Text |
author |
Fringed-Quadtrees New Kind Clara Ionescu |
spellingShingle |
Fringed-Quadtrees New Kind Clara Ionescu STUDIA UNIV. BABES--BOLYAI, INFORMATICA, Volume XLVII, Number 2, 2002 |
author_facet |
Fringed-Quadtrees New Kind Clara Ionescu |
author_sort |
Fringed-Quadtrees New Kind |
title |
STUDIA UNIV. BABES--BOLYAI, INFORMATICA, Volume XLVII, Number 2, 2002 |
title_short |
STUDIA UNIV. BABES--BOLYAI, INFORMATICA, Volume XLVII, Number 2, 2002 |
title_full |
STUDIA UNIV. BABES--BOLYAI, INFORMATICA, Volume XLVII, Number 2, 2002 |
title_fullStr |
STUDIA UNIV. BABES--BOLYAI, INFORMATICA, Volume XLVII, Number 2, 2002 |
title_full_unstemmed |
STUDIA UNIV. BABES--BOLYAI, INFORMATICA, Volume XLVII, Number 2, 2002 |
title_sort |
studia univ. babes--bolyai, informatica, volume xlvii, number 2, 2002 |
publishDate |
2002 |
url |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.4002 http://www.cs.ubbcluj.ro/~studia-i/2002-2/10-Ionescu.pdf |
genre |
The Pointers |
genre_facet |
The Pointers |
op_source |
http://www.cs.ubbcluj.ro/~studia-i/2002-2/10-Ionescu.pdf |
op_relation |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.4002 http://www.cs.ubbcluj.ro/~studia-i/2002-2/10-Ionescu.pdf |
op_rights |
Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
_version_ |
1766216856296751104 |