標(biāo)題: Titlebook: Computational Science and Its Applications - ICCSA 2006; International Confer Marina Gavrilova,Osvaldo Gervasi,Hyunseung Choo Conference pr [打印本頁] 作者: necrosis 時間: 2025-3-21 19:05
書目名稱Computational Science and Its Applications - ICCSA 2006影響因子(影響力)
書目名稱Computational Science and Its Applications - ICCSA 2006影響因子(影響力)學(xué)科排名
書目名稱Computational Science and Its Applications - ICCSA 2006網(wǎng)絡(luò)公開度
書目名稱Computational Science and Its Applications - ICCSA 2006網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computational Science and Its Applications - ICCSA 2006被引頻次
書目名稱Computational Science and Its Applications - ICCSA 2006被引頻次學(xué)科排名
書目名稱Computational Science and Its Applications - ICCSA 2006年度引用
書目名稱Computational Science and Its Applications - ICCSA 2006年度引用學(xué)科排名
書目名稱Computational Science and Its Applications - ICCSA 2006讀者反饋
書目名稱Computational Science and Its Applications - ICCSA 2006讀者反饋學(xué)科排名
作者: armistice 時間: 2025-3-21 22:45
Backward Error Analysis in Computational Geometryant in the context of uncertain data, which may well be the practical context for computational-geometry algorithms such as, say, those for computing convex hulls. The exposition will illustrate the fact that the backward error analysis does not pretend to overcome the problem of finite precision: i作者: 暫時過來 時間: 2025-3-22 02:45 作者: CLASH 時間: 2025-3-22 06:09
Tunable Bounding Volumes for Monte Carlo Applicationsatified samples are generated. We employ various types of light sources including ellipse, elliptic cylinder, elliptic cone and elliptic paraboloid. We perform our technique for Monte Carlo Direct Lighting and Monte Carlo Path Tracing applications. Under similar sample numbers, our technique produce作者: irritation 時間: 2025-3-22 10:22
Computational Science and Its Applications - ICCSA 2006International Confer作者: 完成才能戰(zhàn)勝 時間: 2025-3-22 16:41
https://doi.org/10.1007/978-1-4899-0967-1ant in the context of uncertain data, which may well be the practical context for computational-geometry algorithms such as, say, those for computing convex hulls. The exposition will illustrate the fact that the backward error analysis does not pretend to overcome the problem of finite precision: i作者: 完成才能戰(zhàn)勝 時間: 2025-3-22 20:19 作者: 不足的東西 時間: 2025-3-23 00:41 作者: 里程碑 時間: 2025-3-23 02:26
0302-9743 esearchand applications, encompassing the fac- itating theoretical foundations and the innovative applications of such results in other areas.978-3-540-34070-6978-3-540-34071-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: PLUMP 時間: 2025-3-23 06:42 作者: 字謎游戲 時間: 2025-3-23 13:00 作者: Temporal-Lobe 時間: 2025-3-23 14:18 作者: STALE 時間: 2025-3-23 20:21
Algorithms for Rectangular Covering Problemsscrete) plane by rectangles due to some cost constraints. In this paper we provide exact dynamic programming algorithms for covering point sets by regular rectangles, that have to obey certain boundary conditions. The objective function is to minimize sum of area, circumference and number of patches作者: GRATE 時間: 2025-3-24 01:59
Backward Error Analysis in Computational Geometryutational geometry may cause implementations to fail. The stated purpose was to demonstrate, to students and implementors, the inadequacy of floating-point arithmetic for geometric computations. The examples presented were both useful and insightful, but certain of the accompanying remarks were misl作者: 帶來墨水 時間: 2025-3-24 04:29
Reply to “Backward Error Analysis ...”ssumed real arithmetic may cause implementations to fail. Although this is well known, it is not common knowledge. There is no paper that systematically discusses what can go wrong and provides simple examples for the di.erent ways in which floating-point implementations can fail. Due to this lack o作者: legacy 時間: 2025-3-24 08:27
Two Map Labeling Algorithms for GIS Applicationshe map . such that the rectangular axis-parallel label . can be placed in it. The map region to be labeled is in general non-convex and may contain holes. Our main result is the new polygonal area removal (PAR) algorithm to identify the area within . where the center of the label. can be placed. We 作者: 松果 時間: 2025-3-24 11:51 作者: 放逐某人 時間: 2025-3-24 16:04 作者: 輕彈 時間: 2025-3-24 20:11
Fast Intersections for Subdivision Surfacess, which can lead to slow performance and high memory usage. In this paper we show how the strong convex hull property can lead to a method for efficiently computing intersections at high resolutions. Consequently, the method can be used with any subdivision scheme that has the strong convex hull pr作者: Triglyceride 時間: 2025-3-25 00:25 作者: expansive 時間: 2025-3-25 04:22
Reduction of the Search Space in the Edge-Tracing Algorithm for the Voronoi Diagram of 3D Balls in O(.) time in the worst-case where . and . are the numbers of edges and balls, respectively. The computation time of the algorithm is dominated by finding the end vertex of a given edge since all edges in the Voronoi diagram should be traced essentially. In this paper, we define the feasible regi作者: FILTH 時間: 2025-3-25 08:38 作者: largesse 時間: 2025-3-25 13:18 作者: 單色 時間: 2025-3-25 16:38 作者: 變化無常 時間: 2025-3-25 23:30
Fault Tolerant Guarding of Grids finding two disjoint guard sets in a grid. Although determining the existence of such a structure is easy in general grids, the task of minimising the number of guards taken over both teams is shown to be NP-hard even for subcubic grids. Moreover, we propose a 6/5-approximation algorithm for solvin作者: 一大群 時間: 2025-3-26 00:29 作者: 隨意 時間: 2025-3-26 06:12 作者: 昆蟲 時間: 2025-3-26 09:49 作者: 感激小女 時間: 2025-3-26 13:15 作者: DIS 時間: 2025-3-26 17:55
SIMS — Secondary Ion Mass Spectrometryygon under .. They proposed a linear time algorithm for some given value of .. When the length . is greater than half of the perimeter, they declared that problem as open. Here we address that open problem and present an algorithm whose time complexity is linear in number of vertices of the polygon.作者: vascular 時間: 2025-3-26 23:26 作者: adjacent 時間: 2025-3-27 02:55
Rheology modifiers and pigment dispersants,ently computing intersections at high resolutions. Consequently, the method can be used with any subdivision scheme that has the strong convex hull property. In this method, a bipartite graph structure is used to track potentially intersecting faces.作者: oxidize 時間: 2025-3-27 06:52 作者: 可觸知 時間: 2025-3-27 10:12
Algorithms for Rectangular Covering Problemsular rectangles, that have to obey certain boundary conditions. The objective function is to minimize sum of area, circumference and number of patches used. This objective function may be motivated by requirements of numerically solving PDE’s by discretization over (adaptive multi-)grids.作者: 假裝是我 時間: 2025-3-27 17:21 作者: 漂浮 時間: 2025-3-27 21:24
Reflection High Energy Electron Diffractiont if the triangulation is a fan (i.e. every edge of the triangulation starts from the same vertex), the dilation will be at most approximately 1.48454. We also show that if the triangulation is a star the dilation will be at most 1.18839.作者: Engaged 時間: 2025-3-28 01:35
Nuclear Fission and?Surface Chaoson which a ball to define the end vertex of a given edge should intersect. Then, balls which do not intersect the feasible region are filtered out before finding an end vertex since they cannot define an end vertex. Therefore, we improve the runtime-performance of the edge-tracing algorithm via the feasible region.作者: defibrillator 時間: 2025-3-28 04:28 作者: scotoma 時間: 2025-3-28 06:47 作者: 清楚 時間: 2025-3-28 11:35
Reduction of the Search Space in the Edge-Tracing Algorithm for the Voronoi Diagram of 3D Ballson which a ball to define the end vertex of a given edge should intersect. Then, balls which do not intersect the feasible region are filtered out before finding an end vertex since they cannot define an end vertex. Therefore, we improve the runtime-performance of the edge-tracing algorithm via the feasible region.作者: Constitution 時間: 2025-3-28 17:06 作者: Headstrong 時間: 2025-3-28 22:43
Conference proceedings 2006w, UK, during May 8–11, 2006. It represents the outstanding collection of almost 664 refereed papers selected from over 2,450 submissions to ICCSA 2006. Computational science has ?rmly established itself as a vital part of many scienti?c investigations, a?ecting researchers and practitioners in area作者: expeditious 時間: 2025-3-28 23:57
Reflection High Energy Electron Diffractionove that the weak visibility map of . has complexity Θ(..), and the weak visibility map of . has complexity Θ(..). If . is a polyhedral terrain, the complexity of the weak visibility map is Ω(..) and .(..), both for a segment and a triangle. We also present efficient algorithms to compute all discussed structures.作者: 內(nèi)行 時間: 2025-3-29 03:12 作者: 攀登 時間: 2025-3-29 07:36 作者: 哎呦 時間: 2025-3-29 13:31
Surface Chaos and Its Applicationsestigate complete rectangular grids with obstacles. We show that if both the vertical and the horizontal sizes of the grid are larger than the number of obstacles ., .+2 mobile guarded guards always suffice to cover the grid.作者: 生命 時間: 2025-3-29 16:36
https://doi.org/10.1007/978-981-16-8229-2gy consumption and transfer time required when the control point of the reclaimer moves between 3D grids is defined. This is used as a cost evaluation factor of path optimization along with the safety function. The proposed method can be readily applied to low-performance industrial control devices.作者: Esalate 時間: 2025-3-29 23:31
Visibility Maps of Segments and Triangles in 3Dove that the weak visibility map of . has complexity Θ(..), and the weak visibility map of . has complexity Θ(..). If . is a polyhedral terrain, the complexity of the weak visibility map is Ω(..) and .(..), both for a segment and a triangle. We also present efficient algorithms to compute all discussed structures.作者: 徹底明白 時間: 2025-3-30 03:35
Two Map Labeling Algorithms for GIS Applications most common case when rectangle sides have an axis-parallel orientation. The set of all maximum inscribed rectangles is then post-processed to produce the best size/orientation combination of the final label placement depending on the specific requirements from the end users.作者: 高歌 時間: 2025-3-30 06:24
Surface Reconstruction from Large Point Clouds Using Virtual Shared Memory Manager its utilization for the task of surface reconstruction. By our approach, we were able to process dataset having 1.4M points on 4xP4 interconnected via 100Mb Ethernet in 6 hours. About 5GB of memory was consumed during the reconstruction.作者: Aqueous-Humor 時間: 2025-3-30 09:52 作者: pessimism 時間: 2025-3-30 12:53 作者: Alveolar-Bone 時間: 2025-3-30 20:04
Computational Science and Its Applications - ICCSA 2006978-3-540-34071-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 行為 時間: 2025-3-30 21:55
https://doi.org/10.1007/978-94-009-1457-5ity concerning a set of view elements. In this paper we present an approach for computing a discrete approximation of a multi-visibility map of a triangulated terrain corresponding to a set of view segments, for weak and strong visibility, by using graphics hardware.作者: 機(jī)密 時間: 2025-3-31 04:43 作者: 荒唐 時間: 2025-3-31 08:30
https://doi.org/10.1007/11751540Performance; algorithms; bioinformatics; computational geometry; computer; computer science; data security作者: bourgeois 時間: 2025-3-31 11:43 作者: 抵押貸款 時間: 2025-3-31 15:35
Joseph Kozole,Nicholas WinogradThis paper proposes the use of the . within the realm of Computational Geometry for the design of tree-dimensional space structures arising from planar power diagrams. In order that such structures (to which we apply the term .) can approximate a broad catalogue of quadrics, it will be necessary to formulate this projection under ..作者: 贊美者 時間: 2025-3-31 20:31
https://doi.org/10.1007/978-981-16-8229-2We explore the extremal properties of the Localized Delaunay Triangulation over networks with heterogeneous ranges. We find theoretical bounds on these properties and compare them with those found via experimentation.
