We present a novel armature structure for 3D articulated shapes, called SBall short for skeletal balls, which includes two parts： a one-dimensional skeleton and incident balls. Our algorithm mainly focuses on constru...
详细信息
We present a novel armature structure for 3D articulated shapes, called SBall short for skeletal balls, which includes two parts： a one-dimensional skeleton and incident balls. Our algorithm mainly focuses on constructing the armature structure. This structure is based on an approximation skeleton which is homotopy equivalent to the shape. Each ball in the structure connects a skeletal joint and an interior region of the shape. The boundary vertices on the shape surface are attached onto the SBall using the power diagram of the ball set. A bilateral O^tering algorithm and a variational segmentation algorithm are proposed to enhance the quality of SBall. Finally, applications of this structure are discussed.
A d-dimensional polycube is a (d-1)-face-connected set of cubes in d dimensions. Fixed polycubes are considered distinct if they differ in shape or orientation. The cube-adjacency graph of a tree polycube is a tree. I...
详细信息
In this paper, we re-examine the RSSI measurement model for location estimation and provide the first detailed formulation of the probability distribution of the position of a sensor node. We also show how to use this...
详细信息
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast internal memory and slower external mem...
详细信息
Preserving the "mental map" is a major goal of interactive graph drawing algorithms. Several models have been proposed for formalizing the notion of mental map. Additional work needs to be done to formulate ...
详细信息
Preserving the "mental map" is a major goal of interactive graph drawing algorithms. Several models have been proposed for formalizing the notion of mental map. Additional work needs to be done to formulate and validate "difference" metrics which can be used in practice. This paper introduces a framework for defining and validating metrics to measure the difference between two drawings of the same graph, and gives a preliminary experimental analysis of several simple metrics.
computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibitively expensive in terms of time and/o...
详细信息
In recent years, many theoretically I/O-efficient algorithms and data structures have been developed. The TPIE project at Duke University was started to investigate the practical importance of these theoretical result...
详细信息
The need for a similarity measure for comparing two dra-wings of graphs arises in problems such as interactive graph drawing and the indexing or browsing of large sets of graphs. This paper builds on our previous work...
详细信息
暂无评论