標(biāo)題: Titlebook: Computational Science and Its Applications - ICCSA 2004; International Confer Antonio Laganá,Marina L. Gavrilova,Osvaldo Gervasi Conference [打印本頁] 作者: Daidzein 時間: 2025-3-21 19:35
書目名稱Computational Science and Its Applications - ICCSA 2004影響因子(影響力)
書目名稱Computational Science and Its Applications - ICCSA 2004影響因子(影響力)學(xué)科排名
書目名稱Computational Science and Its Applications - ICCSA 2004網(wǎng)絡(luò)公開度
書目名稱Computational Science and Its Applications - ICCSA 2004網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computational Science and Its Applications - ICCSA 2004被引頻次
書目名稱Computational Science and Its Applications - ICCSA 2004被引頻次學(xué)科排名
書目名稱Computational Science and Its Applications - ICCSA 2004年度引用
書目名稱Computational Science and Its Applications - ICCSA 2004年度引用學(xué)科排名
書目名稱Computational Science and Its Applications - ICCSA 2004讀者反饋
書目名稱Computational Science and Its Applications - ICCSA 2004讀者反饋學(xué)科排名
作者: 旋轉(zhuǎn)一周 時間: 2025-3-21 22:34
Kristine Knutson,Donald J. Lymanmoves (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.作者: agglomerate 時間: 2025-3-22 02:48
C. Oelschlaeger,N. Willenbacher,S. Neserf 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作者: 就職 時間: 2025-3-22 04:47
Christophe Copéret,Bruno Chaudretant 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作者: Femish 時間: 2025-3-22 10:05 作者: 不規(guī)則的跳動 時間: 2025-3-22 13:17 作者: 不規(guī)則的跳動 時間: 2025-3-22 17:33
Analysis of Hydrological Drought,oduced 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作者: 弄污 時間: 2025-3-22 22:08 作者: 輕觸 時間: 2025-3-23 02:42 作者: headway 時間: 2025-3-23 09:35
Surface-Enhanced Raman Scattering hierarchical hexagonal grid structure of the 2d space that fulfills several interesting topological properties. It is known that not all of these properties can be fulfilled together in 3d space. Here we introduce a new 3d hierarchical grid structure that fulfills the most interesting properties. A作者: exhilaration 時間: 2025-3-23 11:02
Surface-Enhanced Raman Spectroscopyes towards INT(P). In?[4] we have shown that |Π(.)| ≤ 1+.+.., where . is the number of reflex vertices of .. We shall now give sharper bounds both for max.|Π(.)| and min.|Π(.)|. Moreover, we characterize the structure of orthogonal polygons in general position for which these new bounds are exact. W作者: 有特色 時間: 2025-3-23 14:49 作者: 出處 時間: 2025-3-23 19:41
Hyperbranched Surface Graft Polymerizations,review and unification of the procedures for generating ., which make it possible to approximate quadric surfaces of various types, both as lattice and panel structures typologies..A clear proposal is derived from this review: the possibility of synthesizing a great diversity of geometric design met作者: Mundane 時間: 2025-3-23 23:54 作者: 很像弓] 時間: 2025-3-24 05:26 作者: 摸索 時間: 2025-3-24 06:54
Antonio Laganá,Marina L. Gavrilova,Osvaldo GervasiIncludes supplementary material: 作者: 一瞥 時間: 2025-3-24 11:29
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/232966.jpg作者: commute 時間: 2025-3-24 15:43 作者: BOOST 時間: 2025-3-24 21:27
978-3-540-22057-2Springer-Verlag Berlin Heidelberg 2004作者: Pulmonary-Veins 時間: 2025-3-25 01:56
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.作者: generic 時間: 2025-3-25 04:29
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 efficient computation.作者: 逗留 時間: 2025-3-25 07:43
Computational Science and Its Applications - ICCSA 2004978-3-540-24767-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 開玩笑 時間: 2025-3-25 12:59 作者: Nuance 時間: 2025-3-25 16:23
Christophe Copéret,Bruno Chaudretant 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 efficient computation.作者: 進入 時間: 2025-3-25 20:44
X-ray Photoelectron Spectroscopy (XPS),One of the popular geometric optimization problems is that of finding the maximum radius .. of . equal and non-overlapping discs to be packed in a unit square. It has been widely explored with a number of surprising results (see e.g. [2]).作者: 痛打 時間: 2025-3-26 01:09 作者: 憤慨點吧 時間: 2025-3-26 06:50
Surface-Enhanced Raman SpectroscopyWe propose . – a new technique for generating orthogonal polygons with a given number of vertices from a unit square based on gluing rectangles. It is dual to . – a technique we introduced in?[12] that works by cutting rectangles.作者: 厚臉皮 時間: 2025-3-26 11:48
https://doi.org/10.1007/11569084We 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.作者: Iatrogenic 時間: 2025-3-26 14:20 作者: interrogate 時間: 2025-3-26 20:44 作者: scotoma 時間: 2025-3-26 21:19 作者: Criteria 時間: 2025-3-27 03:25
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.作者: 自愛 時間: 2025-3-27 08:31
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 時間: 2025-3-27 13:16
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 時間: 2025-3-27 17:41
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作者: 命令變成大炮 時間: 2025-3-27 20:48
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 時間: 2025-3-28 00:03 作者: outset 時間: 2025-3-28 03:56 作者: exigent 時間: 2025-3-28 08:06
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 時間: 2025-3-28 12:57 作者: Haphazard 時間: 2025-3-28 14:37 作者: allergy 時間: 2025-3-28 19:47
3D-Color-Structure-Code – A New Non-plainness Island Hierarchy hierarchical hexagonal grid structure of the 2d space that fulfills several interesting topological properties. It is known that not all of these properties can be fulfilled together in 3d space. Here we introduce a new 3d hierarchical grid structure that fulfills the most interesting properties. A作者: 遍及 時間: 2025-3-29 00:35
Partitioning Orthogonal Polygons by Extension of All Edges Incident to Reflex Vertices: Lower and Upes towards INT(P). In?[4] we have shown that |Π(.)| ≤ 1+.+.., where . is the number of reflex vertices of .. We shall now give sharper bounds both for max.|Π(.)| and min.|Π(.)|. Moreover, we characterize the structure of orthogonal polygons in general position for which these new bounds are exact. W作者: 獨行者 時間: 2025-3-29 03:13
On the Time Complexity of Rectangular Covering Problems in the Discrete Planerticularly we prove the NP-hardness of such a problem(class) defined by the following objective function: Simultaneously minimize the total area, the total circumference and the number of rectangles used for covering (where the length of every rectangle side is required to lie in a given interval). 作者: 含沙射影 時間: 2025-3-29 09:15 作者: 消瘦 時間: 2025-3-29 12:44 作者: Motilin 時間: 2025-3-29 18:29 作者: Meander 時間: 2025-3-29 23:02 作者: gastritis 時間: 2025-3-30 00:23
Conference proceedings 2004esult the key to understanding the explosive growth of this discipline lies in two adjectives that more and more appropriately refer to Computational Science and its applications: interoperable and ubiquitous. Numerous examples of ubiquitous and interoperable tools and applicationsaregivenintheprese作者: enchant 時間: 2025-3-30 06:04
Computational Science and Its Applications - ICCSA 2004International Confer作者: Constituent 時間: 2025-3-30 08:51 作者: 類型 時間: 2025-3-30 12:50
C. Oelschlaeger,N. Willenbacher,S. Neserrientations to be considered by using geometric inequalities in the slope diagrams of A and B. In this way the time complexity of .(..) is reduced to .(..). This is derived, and verified experimentally.作者: Liberate 時間: 2025-3-30 17:26
Surface-Initiated Polymerization IBy using a tiling argument we also prove that a variant of this problem, fixing only the minimal side length of rectangles, is NP-hard. Such problems may appear at the core of applications like data compression, image processing or numerically solving partial differential equations by multigrid computations.作者: 矛盾心理 時間: 2025-3-31 00:37 作者: GNAT 時間: 2025-3-31 03:16 作者: hegemony 時間: 2025-3-31 06:39 作者: Eosinophils 時間: 2025-3-31 10:02 作者: 擋泥板 時間: 2025-3-31 16:02
Surface-Enhanced Raman Spectroscopy max.|Π(.)| and min.|Π(.)|. Moreover, we characterize the structure of orthogonal polygons in general position for which these new bounds are exact. We also present bounds on the area of grid .-ogons and characterize those having the largest and the smallest area.作者: observatory 時間: 2025-3-31 19:10
Hyperbranched Surface Graft Polymerizations,d panel structures typologies..A clear proposal is derived from this review: the possibility of synthesizing a great diversity of geometric design methods and techniques by means of a classic Computational Geometry construct, the ., deriving from it the concept of ..作者: 相信 時間: 2025-3-31 22:17 作者: ANTI 時間: 2025-4-1 05:10
Improving the Global Continuity of the Natural Neighbor Interpolation-degree polynomial, the interpolant can reproduce that polynomial exactly. The idea used to derive the interpolant is applicable to obtain a globally C. interpolant for an arbitrary non-negative integer .. Hence, this paper gets rid of the continuity limitation of the natural neighbor interpolation, and thus leads it to a new research stage.作者: ALIAS 時間: 2025-4-1 09:45
3D-Color-Structure-Code – A New Non-plainness Island Hierarchyperties can be fulfilled together in 3d space. Here we introduce a new 3d hierarchical grid structure that fulfills the most interesting properties. A 3d CSC-segmentation based on this grid structure has been implemented.作者: exhilaration 時間: 2025-4-1 13:01
Partitioning Orthogonal Polygons by Extension of All Edges Incident to Reflex Vertices: Lower and Up max.|Π(.)| and min.|Π(.)|. Moreover, we characterize the structure of orthogonal polygons in general position for which these new bounds are exact. We also present bounds on the area of grid .-ogons and characterize those having the largest and the smallest area.作者: 保守 時間: 2025-4-1 15:55 作者: 與野獸博斗者 時間: 2025-4-1 19:07
