In this paper we will consider a problem known as simplex range searching Preprocess a set
P of n points in Ed so that, given any query simplex Q, the points in P n Q can be counted or …

… Back in SoCG’92, Matoušek gave a partition tree method for d-… Our partition trees satisfy many
ideal properties (eg, constant … • It leads to more efficient multilevel partition trees, which are …

… To overcome the disadvantages caused by eccentric sons, we present a new type of the
bisector tree - the so-called Monotonous Bisector Tree (see [17]) - for partitioning large sets of …

… These principles are partial ordering by magnitude with a set partitioning sorting algorithm,
… and different implementation based on set partitioning in hierarchical trees (SPIHT), which …

… , in determining the efficiency of partitioning tree algorithms (… the partitioning tree as a
computation graph, so the tree is the … on a tree, it becomes misleading to compare tree size directly …

… This study about binary partition trees is related to several … In this paper, we discuss the
interest of binary partition trees to … As will be seen in this paper, binary partition trees strongly …

… an algorithm for partitioning a graph that is in the form of a tree. … Next we describe the tree
partitioning algorithm and illustrate … In particular we show that a tree partitioning problem of the …

… Abstract-The efficient partitioning of a finite-dimensional space by a decision tree, each …
constant approximation, and in the efficient programming of decision trees. A two-stage algorithm …

… -tree method presented in this paper the approach included in the ‘category-partition method’
has … The category-partition method cannot be used efficiently without the generator tool. …

… partitioning problems, in section 5 we apply the partial k-tree algorithm design method to
vertex partitioning problems, and in section 6 we give the efficient … partial k-trees. We conclude …