Titlebook: Computational Science and Its Applications - ICCSA 2004; International Confer Antonio Laganá,Marina L. Gavrilova,Osvaldo Gervasi Conference

scotoma

Criteria

Approximating Smallest Enclosing BallsWe present two novel tailored algorithms for computing arbitrary fine approximations of the smallest enclosing ball of balls. The deterministic heuristics are based on solving relaxed decision problems using a primal-dual method.

自爱

Geometric Graphs Realization as Coin Graphsed as a coin graph (with coins centered at the vertices of the graph). This paper presents an algorithm to decide whether a planar connected geometric graph is a coin graph and to obtain, in the affirmative case, all the coin sets whose contact graphs are the given graph. This result is generalized

conjunctivitis

On Local Transformations in Plane Geometric Graphs Embedded on Small Gridsmoves (all point moves stay within a 5.× 5. grid) and .(..) edge moves, we can transform .. into ... In the case of .-vertex trees, we can perform the transformation with .(.) point and edge moves, and show this is optimal. We also study the equivalent problems in the labelled setting.

geriatrician

Reducing the Time Complexity of Minkowski-Sum Based Similarity Calculations by Using Geometric Inequf relative orientations. The relative orientations are characterized by the fact that faces and edges of A and B are parallel as much as possible. For one of these relative orientations the similarity measure is optimal. In this article we propose and test a method to reduce the number of relative o

命令变成大炮

Plane-Sweep Algorithm of O(nlogn) for the Inclusion Hierarchy among Circlesant for various applications such as the simulation of emulsion. In this paper, we present a standard plane-sweep algorithm which can identify the inclusion relationship among the circles in .(.) time in the worst-case. The algorithm uses a number of sweep-lines and a red-black tree for the efficien

RAGE

outset

exigent

Combinatories and Triangulationsoduced here and, specially, this paper is dedicated to the brute force methods. Several new brute force methods that solve the problem from different points of view are described here. Although they have NP time complexity, we accelerate the time needed for computation maximally to get results of as

byline