In this paper we present a novel integrated 3D editing environment that combines recent advantages in various fields of computergraphics, such as shape modelling, video-based Human computer Interaction, force feedbac...
详细信息
Numerical simulations, which are based on reliable biomechanical models of blood vessels, can help to get a better understanding of cardiovascular diseases such as atherosclerosis, and can be used to develop optimal m...
详细信息
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...
详细信息
Two planar triangulations with a correspondence between two vertex sets are compatible (isomorphic) if they are topologically equivalent. This work presents a simple and robust method for morphing two compatible plana...
详细信息
Two planar triangulations with a correspondence between two vertex sets are compatible (isomorphic) if they are topologically equivalent. This work presents a simple and robust method for morphing two compatible planar triangulations with identical convex boundaries that locally preserves the intrinsic geometric properties of triangles throughout the morph. The method is based on the barycentric coordinates representation of planar triangulations, and thus, guarantees compatibility of all intermediate triangulations. The intrinsic properties are preserved by interpolating angles and edge lengths components of mean value barycentric coordinates, rather than interpolating the barycentric coordinates themselves. As a result, the method generates a natural-looking and guaranteed intersection-free morphing sequence.
Besides entertainment, three main areas of application attract industrial interest in virtual environment (VE): marketing, prototyping, and training. Advanced VEs derived from available CAD data or simulation results ...
详细信息
Besides entertainment, three main areas of application attract industrial interest in virtual environment (VE): marketing, prototyping, and training. Advanced VEs derived from available CAD data or simulation results still require efficient tools for data preparation, as well as high-end workstations and peripherals. The high costs for these advanced VEs prevent small and medium companies from taking the first steps in this direction.
Height fields and depth maps which we collectively refer to as z-fields, usually carry a lot of redundant information and are often used in real-time applications. This is the reason why efficient methods for their si...
详细信息
Recently I. Jensen published a novel transfer-matrix algorithm for computing the number of polyominoes in a rectangular lattice. However, his estimation of the computational complexity of the algorithm (O((√2) n)) wh...
详细信息
ISBN:
(纸本)0898715644
Recently I. Jensen published a novel transfer-matrix algorithm for computing the number of polyominoes in a rectangular lattice. However, his estimation of the computational complexity of the algorithm (O((√2) n)) where n is the size of the polyominoes), was based only on empirical evidence. This paper is based primarily on an analysis of the number of some class of strings that plays a significant role in the algorithm. It turns out that this number is closely related to Motzkin's numbers. We provide a rigorous computation that roughly confirms Jensen's estimation. We obtain the bound O(n5/2(√3)n) on the running time of the algorithm, while the actual number of polyominoes is about C4.06n/n, for some constant C > 0.
The most strings with few bad columns problem is an NP-hard combinatorial optimization problem from the bioinformatics field. This paper presents the first integer linear programming model for this problem. Moreover, ...
详细信息
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path between two vertices contains more than D ...
详细信息
ISBN:
(纸本)9781581136241
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path between two vertices contains more than D edges. This problem is NP-hard for 4 ≤ D
A d-dimensional polycube is a facet-connected set of cubes in d dimensions. Fixed polycubes are considered distinct if they differ in shape or orientation. A proper d-D polycube spans all d dimensions. In this paper w...
详细信息
暂无评论