An object-space hidden-line algorithm for higher-dimensional scenes has been designed and implemented. Scenes consist of convex hulls of any dimension, each of which is compared against the edges of all convex hulls not eliminated by a hyperdimensional clipper, a depth test after sorting and a minimax text. Hidden and visible elements are determined in accordance with the dimensionality of the ...

All of the existing (iceberg) cube computation algorithms assume that the data is stored in a single base table, however, in practice, a data warehouse is often organized in a schema of multiple tables, such as star schema and snowflake schema. In terms of both computation time and space, materializing a universal base table by joining multiple tables is often very expensive or even unaffordabl...

The Black Box is a site based installation that allows users to create unique sounds through physical interaction. The installation consists of a geodesic dome, surround sound speakers, and a custom instrument suspended from the apex of the dome. Audience members entering the space are able to create sound by striking or rubbing the cube, and are able to control a delay system by moving the cub...

A complete data cube is a data cube in which every aggregate value in the multidimensional space is stored or can be computed. An incomplete data cube is a data cube in which points in the multidimensional space are missing and cannot be computed. This paper describes an incomplete data cube design. An incomplete data cube is modeled as a federation of cubettes. A cubette is a complete sub-cube...

Image Cube Trajectory (ICT) analysis is a new and robust method to estimate the 3D structure of a scene from a set of 2D images. The motion of points in 3D space is represented by trajectories in an image cube. The advantage of this method is that the motion information of a single 3D point can be jointly represented and analyzed for all available views of an image sequence. In this paper we wi...

1. For each i>0, let 7, denote the closed interval O^x^ 1 and let °I¡ denote the open interval 0<*< 1. Let 7°° =fli>o 7 and °7°° = rii>o °h7°° is the Hilbert cube or parallelotope sometimes denoted by Q. °7°° is homeomorphic to the space sometimes called s, the countable infinite product of lines. The principal theorems of this paper are found in §§5, 7, 8, and 9. In §5 it is shown as a special...

Hierarchical clustering has been proved an effective means for physically organizing large fact tables since it reduces significantly the I/O cost during ad hoc OLAP query evaluation. In this paper, we propose a novel multidimensional file structure for organizing the most detailed data of a cube, the CUBE File. The CUBE File achieves hierarchical clustering of the data, enabling fast access vi...

In this paper, we present a fast algorithm to answer rangesum queries in OLAP data cubes. Our algorithm supports constanttime queries while maintaining sub-linear time update and using minimum space. Furthermore, we study the trade-off between query time and update time. The complexity for query is O(2) and for updates O((2 2 l √ n)) on a data cube of n elements, where l is a trade-off paramete...