Sciweavers

3020 search results - page 16 / 604
» Optimal partition trees
Sort
View
IPL
2002
107views more  IPL 2002»
14 years 11 months ago
Binary space partitions for axis-parallel line segments: Size-height tradeoffs
We present worst-case lower bounds on the minimum size of a binary space partition (BSP) tree as a function of its height, for a set S of n axis-parallel line segments in the plan...
Sunil Arya
FSTTCS
2004
Springer
15 years 5 months ago
Approximate Range Searching Using Binary Space Partitions
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
Mark de Berg, Micha Streppel
CORR
2010
Springer
144views Education» more  CORR 2010»
14 years 11 months ago
Optimal Partitions in Additively Separable Hedonic Games
We conduct a computational analysis of partitions in additively separable hedonic games that satisfy standard criteria of fairness and optimality. We show that computing a partiti...
Haris Aziz, Felix Brandt, Hans Georg Seedig
ICIP
2001
IEEE
16 years 1 months ago
Region-of-interest coding based on set partitioning in hierarchical trees
Keun-hyeong Park, Chul-Soo Lee, Hyun Wook Park
CCCG
2003
15 years 1 months ago
Linear Binary Space Partitions and the Hierarchy of Object Classes
We consider the problem of constructing binary space partitions for the set P of d-dimensional objects in d-dimensional space. There are several classes of objects defined for su...
Petr Tobola, Karel Nechvíle