Titlebook: Computational Science and Its Applications - ICCSA 2007; International Confer Osvaldo Gervasi,Marina L. Gavrilova Conference proceedings 20

Dendritic-Cells

Efficient Colored Point Set Matching Under Noise . under color preserving rigid motion, assuming that the position of all colored points in both sets contains a certain amount of ”noise”. The process consists of two main stages: a lossless filtering algorithm and a matching algorithm. The first algorithm determines a number of .andidate zones whi

背心

易于交談

殘酷的地方

GONG

慎重

Shortest Path Queries in a Simple Polygon for 3D Virtual Museum on the polygon’s VD, we first find the Voronoi skeleton path .(.,.) from point. to ., and then along which we compute the shortest path .(.,.) by visibility computing simultaneously. .(.,.) can be reported in time .(.). It can be used in our 3D virtual museum system, in which the polygon’s VD is us

prostate-gland

Linear Axis for General Polygons: Properties and Computationich is controlled by means of parameter .>?0. A?significant advantage of a linear axis is that its edges are straight line segments. We generalize the notion of a linear axis and the algorithm for its efficient computation to the case of general polygons, which might contain holes. We show that a li

語源學(xué)

A Geometric Approach to Clearance Based Path Optimizationmap method, the cell decomposition method, and the potential field method generate low quality paths with redundant motions which are post-processed to generate high quality approximations of the optimal path. In this paper, we present a .(..(.?+?.)) algorithm to optimize a path between a source and

踉蹌

3D Spatial Operations in Geo DBMS Environment for 3D GISsuch software or system is the geometric modeling that works with 3D spatial operations. This paper presents a portion of problem that we currently attempt to solve, that is the 3D spatial operations for Geo DBMS. Some popular spatial operations in 3D GIS for example 3D XOR, 3D union, 3D intersectio

Assault

A Page Padding Method for Fragmented Flash Storager may expect steady performance under disk fragmentation in flash storage. However, most commercial products do not satisfy this expectation. For example, a SDMMC card can be written in 18.7Mbytes/sec speed sequentially, but its write speed is slowed down to 3.2Mbytes/sec when it is seriously fragme