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

只看該作者 · 發(fā)表于 2025-3-27 03:25:15

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.

只看該作者 · 發(fā)表于 2025-3-27 08:31:45

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

只看該作者 · 發(fā)表于 2025-3-27 13:16:50

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.

只看該作者 · 發(fā)表于 2025-3-27 17:41:51

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

只看該作者 · 發(fā)表于 2025-3-27 20:48:42

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

只看該作者 · 發(fā)表于 2025-3-28 00:03:27

只看該作者 · 發(fā)表于 2025-3-28 03:56:22

只看該作者 · 發(fā)表于 2025-3-28 08:06:55

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

只看該作者 · 發(fā)表于 2025-3-28 12:57:34

		自動(dòng)登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點(diǎn)評(píng)	投稿經(jīng)驗(yàn)總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-16 19:58
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved