Coordinatizing R-trees in terms of universal c-trees

被引：0
|
作者：
Werner F. Terhalle
机构：
[1] Bielefeld University,Research Center for Interdisciplinary Studies on Structure Formation (FSPM)
来源：
Annals of Combinatorics | 1997年 / 1卷 / 1期
关键词：
05B35; 05C05; ℝ=trees; valuated matroids;
D O I：
10.1007/BF02558474
中图分类号：
学科分类号：
摘要：
A complete ℝ-treeT will be constructed such that, for everyxσT, the cardinality of the set of connected components ofT{x} is the same and equals a pre-given cardinalityc; by this construction simultaneously the valuated matroid of the ends of this ℝ-tree is given. In addition, for any arbitrary ℝ-tree, an embedding into such a “universalc-tree” (for suitablec) will be constructed.
引用
收藏
页码：183 / 196
页数：13
相关论文
共 50 条
  • [21] Parallel Implementation of R-trees on the GPU
    Luo, Lijuan
    Wong, Martin D. F.
    Leong, Lance
    2012 17TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE (ASP-DAC), 2012, : 353 - 358
  • [22] Semilinear Metric Semilattices on R-trees
    Andreev, P. D.
    RUSSIAN MATHEMATICS, 2007, 51 (06) : 1 - 10
  • [23] Algorithms for improving the quality of R-trees
    Skvortsov A.V.
    Russian Physics Journal, 2001, 44 (6) : 588 - 595
  • [24] GROUP-ACTIONS ON R-TREES
    CULLER, M
    MORGAN, JW
    PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 1987, 55 : 571 - 604
  • [25] R-trees for astronomical data indexing
    Baruffolo, A
    ASTRONOMICAL DATA ANALYSIS SOFTWARE AND SYSTEMS VIII, 1999, 172 : 375 - 378
  • [26] R-trees and symmetric differences of sets
    Terhalle, WF
    EUROPEAN JOURNAL OF COMBINATORICS, 1997, 18 (07) : 825 - 833
  • [27] On R-trees with low query complexity
    de Berg, M
    Gudmundsson, J
    Hammar, M
    Overmars, M
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2003, 24 (03): : 179 - 195
  • [28] A study of concurrent operations on R-trees
    Chen, JK
    Huang, YF
    Chin, YH
    INFORMATION SCIENCES, 1997, 98 (1-4) : 263 - 300
  • [29] R-TREES, SMALL CANCELLATION, AND CONVERGENCE
    CHERMAK, A
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1995, 347 (11) : 4515 - 4531
  • [30] Cache-Oblivious R-Trees
    Lars Arge
    Mark de Berg
    Herman Haverkort
    Algorithmica, 2009, 53 : 50 - 68
12345