455 search results - page 10 / 91 » On Trees and Noncrossing Partitions |
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
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, ...
ICIP
2001
IEEE
14 years 9 months ago
2001
IEEE
SIBGRAPI
2008
IEEE
14 years 2 months ago
2008
IEEE
This work proposes a simple approximation scheme for discrete data that leads to an infinitely smooth result without global optimization. It combines the flexibility of Binary Sp...
CCCG
2003
13 years 9 months ago
2003
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...
IWOCA
2009
Springer
14 years 2 months ago
2009
Springer
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...