Titlebook: Computational Science and Its Applications - ICCSA 2011; International Confer Beniamino Murgante,Osvaldo Gervasi,Bernady O. Apdu Conference

FID

An Optimal Hidden-Surface Algorithm and Its Parallelization are given for the problems called hidden-line and hidden-surface removal in computer graphics. More precisely, algorithms are proposed to find the portions of the edges visible from (0,0,?∞?) and to find the upper envelope (i.e., the pointwise maximum) of the polygons. The proposed solution for the

obsession

名詞

BORE

裂口

A Practical Solution for Aligning and Simplifying Pairs of Protein Backbones under the Discrete Frécof research has been done in the past on this problem, using RMSD as the distance measure. Recently, the discrete Fréchet distance has been applied to align and simplify protein backbones (geometrically, 3D polygonal chains) by Jiang et al., with insightful new results found. On the other hand, as a

infarct

倫理學(xué)

Topology Construction for Rural Wireless Mesh Networks - A Geometric Approachto-point links are established in the nodes of such networks using high gain directional antennas. Some nodes are directly linked to the wired internet, and the others link to these using a small number of hops..Minimization of system cost is an important objective in these networks, since generally

SLING

An Adapted Version of the Bentley-Ottmann Algorithm for Invariants of Plane Curves Singularitiese-dimensional graph. This graph is given as a set of vertices together with their space Euclidean coordinates, and a set of edges connecting them. More precisely, the three-dimensional graph represents the approximation of a closed and smooth implicitly defined space algebraic curve, that allows us

吞下

A Heuristic Homotopic Path Simplification Algorithm, for a given error, the goal is to find a path with the minimum number of vertices while preserving the homotopy in presence of a given set of extra points in the plane. We present a heuristic method for homotopy-preserving simplification under any desired measure for general paths. Our algorithm f

內(nèi)閣

An Improved Approximation Algorithm for the Terminal Steiner Tree Problemith all the vertices of . as its leaves. Then the terminal Steiner tree problem is to find a terminal Steiner tree in . with minimum length. In this paper, we present an approximation algorithm with performance ratio . for the terminal Steiner tree problem, where . is the best-known performance rati