61 search results - page 4 / 13 » On the Number of Graphical Forest Partitions |
SIBGRAPI
2006
IEEE
13 years 12 months ago
2006
IEEE
This work introduces a new compression scheme for point sets. This scheme relies on an adaptive binary space partition (BSP) which takes into account the geometric structure of the...
DCC
2005
IEEE
14 years 5 months ago
2005
IEEE
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
DCC
2003
IEEE
14 years 5 months ago
2003
IEEE
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix...
VISUALIZATION
2002
IEEE
13 years 11 months ago
2002
IEEE
We present a novel disk-based multiresolution triangle mesh data structure that supports paging and view-dependent rendering of very large meshes at interactive frame rates from e...
SIAMCOMP
1998
13 years 5 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...