標題: Titlebook: Discrete and Computational Geometry; Japanese Conference, Jin Akiyama,Mikio Kano,Masatsugu Urabe Conference proceedings 2000 Springer-Verla [打印本頁] 作者: 帳簿 時間: 2025-3-21 17:57
書目名稱Discrete and Computational Geometry影響因子(影響力)
書目名稱Discrete and Computational Geometry影響因子(影響力)學科排名
書目名稱Discrete and Computational Geometry網(wǎng)絡(luò)公開度
書目名稱Discrete and Computational Geometry網(wǎng)絡(luò)公開度學科排名
書目名稱Discrete and Computational Geometry被引頻次
書目名稱Discrete and Computational Geometry被引頻次學科排名
書目名稱Discrete and Computational Geometry年度引用
書目名稱Discrete and Computational Geometry年度引用學科排名
書目名稱Discrete and Computational Geometry讀者反饋
書目名稱Discrete and Computational Geometry讀者反饋學科排名
作者: 品牌 時間: 2025-3-21 22:40 作者: 油膏 時間: 2025-3-22 03:02 作者: 叫喊 時間: 2025-3-22 07:40 作者: concentrate 時間: 2025-3-22 12:11 作者: lethal 時間: 2025-3-22 13:17
NP-Completeness of Stage Illumination Problemss completely illuminated. The problem for finding a polynomial time algorithm for this problem or proving NP-hardness of this problem was open. This paper shows that it is NP-complete even with some restrictions.作者: lethal 時間: 2025-3-22 19:17
On the Maximum Degree of Bipartite Embeddings of Trees in the Planertite sets . and ., i.e., .(.) = . ∪ ., then . is denoted by .(., .). Let . and . be two disjoint sets of points in the plane such that |.| = |.| and no three points of . ∪ . are tollinear. Then we show that the geometric complete bipartite graph .(., .) contains a spanning tree . without crossings such that the maximum degree of . is at most 3.作者: 點燃 時間: 2025-3-22 22:51
Efficient Regular Polygon Dissections consider polygonal cuts, i.e., the minimum number .(4,.) of pieces needed to dissect a square into a regular n-gon of the same area using polygonal cuts and show that ., holds for sufficiently large .. We also consider regular polygon-polygon dissections and obtain similar bounds for .(.,.) and .(...).作者: PLAYS 時間: 2025-3-23 02:57
On Soddy’s Hexlet and a Linked 4-Pair6, and in any (3,6)-link, each ball in the 3-cycle is tangent to all balls in the 6-cycle, (2) a (4,4)-cycle exists and in any (4,4)-cycle, each ball in a 4-cycle is tangent to all balls in the other 4-cycle.作者: Enteropathic 時間: 2025-3-23 06:17
Convex Hull Problem with Imprecise Inputthe intersection and the union of all possible convex hulls. The gap of these two hulls explicitly represents the accuracy of a possible convex hull. Under an assumption that the size of error is given for each input point, we show that the inner convex hull and the outer convex hull are calculated in .(. log .) time for . points in the plane.作者: Conjuction 時間: 2025-3-23 10:19
https://doi.org/10.1007/978-1-4419-0861-2ethod briefly, and extends it to data distributed over line segments. For this purpose, we utilize line segment Voronoi diagrams. The resulting interpolant is expressed in terms of the integrations of the data function over the given line segments.作者: 傲慢物 時間: 2025-3-23 15:41
0302-9743 ry ’98. The conference was held 9-12 - cember 1998 at Tokai University in Tokyo. Close to a hundred participants from 10 countries participated. Interest in Computational Geometry surfaced among engineers in Japan - out twenty years ago, while interest in Discrete Geometry arose as a natural extensi作者: 樹木中 時間: 2025-3-23 20:25
Other Inflammatory Disorders of Duodenumg of . into . convex pieces such that each piece has the same area and . of the perimeter of . . We show that for any ., any convex set admits a perfect .-partitioning. Perfect partitionings with additional constraints are also studied.作者: ATRIA 時間: 2025-3-24 01:23 作者: TAG 時間: 2025-3-24 03:58
https://doi.org/10.1007/978-1-4419-0861-2rtite sets . and ., i.e., .(.) = . ∪ ., then . is denoted by .(., .). Let . and . be two disjoint sets of points in the plane such that |.| = |.| and no three points of . ∪ . are tollinear. Then we show that the geometric complete bipartite graph .(., .) contains a spanning tree . without crossings such that the maximum degree of . is at most 3.作者: 刀鋒 時間: 2025-3-24 10:15 作者: SPURN 時間: 2025-3-24 12:56
https://doi.org/10.1007/978-1-4419-0861-26, and in any (3,6)-link, each ball in the 3-cycle is tangent to all balls in the 6-cycle, (2) a (4,4)-cycle exists and in any (4,4)-cycle, each ball in a 4-cycle is tangent to all balls in the other 4-cycle.作者: 老巫婆 時間: 2025-3-24 18:42
Enterprise Risk Management in Healthcarethe intersection and the union of all possible convex hulls. The gap of these two hulls explicitly represents the accuracy of a possible convex hull. Under an assumption that the size of error is given for each input point, we show that the inner convex hull and the outer convex hull are calculated in .(. log .) time for . points in the plane.作者: G-spot 時間: 2025-3-24 20:27
Malabsorption and Malnutrition Disorders its interior, without turning the surfaces over. Using tilings of the plane, we produce Dudeney dissections of quadrilaterals to other quadrilaterals, quadrilaterals to parallelograms, triangles to parallelograms, parallelhexagons to trapezoids, parallelhexagons to triangles, and trapezoidal pentagons to trapezoids.作者: annexation 時間: 2025-3-25 00:24
Other Inflammatory Disorders of Duodenumstances between corresponding points, the same problem is solvable in polynomial time even for .≥3 as far as . is a fixed constant. For the case .=2, effective use of geometric property of an optimal solution leads to considerable improvement on the computational complexity. Other related topics are also discussed.作者: Tdd526 時間: 2025-3-25 05:39
Pathology of Malabsorption Syndrome the resolution rule should be respected. As in most of the graph drawing algorithms, the area used for the drawing is very important. Our proposed algorithms produce drawings that require .(..) area, where . is the number of nodes in the ring cover.作者: Ataxia 時間: 2025-3-25 07:39
Dudeney Dissection of Polygons its interior, without turning the surfaces over. Using tilings of the plane, we produce Dudeney dissections of quadrilaterals to other quadrilaterals, quadrilaterals to parallelograms, triangles to parallelograms, parallelhexagons to trapezoids, parallelhexagons to triangles, and trapezoidal pentagons to trapezoids.作者: 里程碑 時間: 2025-3-25 14:50
Effective Use of Geometric Properties for Clusteringstances between corresponding points, the same problem is solvable in polynomial time even for .≥3 as far as . is a fixed constant. For the case .=2, effective use of geometric property of an optimal solution leads to considerable improvement on the computational complexity. Other related topics are also discussed.作者: 瑣碎 時間: 2025-3-25 18:04 作者: 對手 時間: 2025-3-25 23:48 作者: 遣返回國 時間: 2025-3-26 03:15 作者: Hormones 時間: 2025-3-26 07:41 作者: Minuet 時間: 2025-3-26 12:21 作者: 征服 時間: 2025-3-26 16:15 作者: WAIL 時間: 2025-3-26 17:34 作者: 窒息 時間: 2025-3-26 21:55 作者: Functional 時間: 2025-3-27 04:21 作者: LIKEN 時間: 2025-3-27 05:43
978-3-540-67181-7Springer-Verlag Berlin Heidelberg 2000作者: CURB 時間: 2025-3-27 12:13 作者: 輕打 時間: 2025-3-27 16:39
Malabsorption and Malnutrition Disordersme way, without turning over the surfaces, to form .. An examination of Dudeney’s method of partition motivates us to introduce the notion of Dudeney dissections of various polygons to other polygons..Let . and . be polygons with the same area. A . is a partition of . into parts which tan be reassem作者: 和藹 時間: 2025-3-27 20:33
Other Inflammatory Disorders of Duodenumed graph . of . vertices,is there a partition of the vertex set into . disjoint subsets so that the maximum weight of an innercluster edge (whose two endpoints both belong to the same subset) is minimized. This problem is known to be NP-complete even for .=3. The case of .=2, that is, bipartition pr作者: 發(fā)展 時間: 2025-3-27 23:50
Other Inflammatory Disorders of Duodenumyhedra. We describe an important and difficult class of polyhedra, called configuration polytopes, that have application to determining the ground states of alloy phase diagrams. Experience gained while trying to solve these problems lead to a number of improvements to the original implementation.作者: 大喘氣 時間: 2025-3-28 04:38
Other Inflammatory Disorders of Duodenum.) be the smallest integer such that every set of points in the plane, no three collinear, containing at least .(.) interior points has a subset of points containing . or . + 1 interior points. We proved that .(3) =3 in an earlier paper. In this paper we prove that .(4) = 7.作者: 漫步 時間: 2025-3-28 08:43 作者: 子女 時間: 2025-3-28 12:37 作者: 移植 時間: 2025-3-28 17:18
https://doi.org/10.1007/978-1-4419-0861-2f cuts. The folds are based on the straight skeleton, which lines up the desired edges by folding along various bisectors; and a collection of perpendiculars that make the crease pattern foldable. We prove that the crease pattern is flat foldable by demonstrating a family of folded states with the d作者: Cuisine 時間: 2025-3-28 21:03
https://doi.org/10.1007/978-1-4419-0861-2d for discrete data using Voronoi diagrams. Recently, Gross and Farin extended Sibson’s interpolant to continuous data distributed over polygons and circles. On the other hand, the authors recently found another interpolation method for discrete data. This paper outlines the authors’ interpolation m作者: Extort 時間: 2025-3-29 00:48 作者: 積習已深 時間: 2025-3-29 04:33 作者: Postulate 時間: 2025-3-29 08:00
https://doi.org/10.1007/978-1-4419-0861-2.) is a set of (possibly crossing) straight-line segments whose endpoints belang to .(.). If a geometric graph . is a complete bipartite graph with partite sets . and ., i.e., .(.) = . ∪ ., then . is denoted by .(., .). Let . and . be two disjoint sets of points in the plane such that |.| = |.| and 作者: 大方一點 時間: 2025-3-29 15:02 作者: 茁壯成長 時間: 2025-3-29 19:02
https://doi.org/10.1007/978-1-4419-0861-2 of an .-cycle and an .-cycle that form a non-splittable link, with no two balls overlapping. It is proved that (1) a (3,.)-link exists only when . ≥ 6, and in any (3,6)-link, each ball in the 3-cycle is tangent to all balls in the 6-cycle, (2) a (4,4)-cycle exists and in any (4,4)-cycle, each ball 作者: 可互換 時間: 2025-3-29 20:44
https://doi.org/10.1007/978-1-4419-0861-2nit disk graphs. When the given unit disk graph is defined on a slab whose width is ., we propose an algorithm for finding a maximum independent set in . time where . denotes the number of vertices. We also propose a (1 – 1/r)-approximation algorithm for the maximum independent set problems on a (ge作者: 不能妥協(xié) 時間: 2025-3-30 00:52 作者: dialect 時間: 2025-3-30 05:19 作者: 最高峰 時間: 2025-3-30 10:26 作者: Lobotomy 時間: 2025-3-30 12:27 作者: 背書 時間: 2025-3-30 19:47 作者: Musculoskeletal 時間: 2025-3-31 00:04
Living with ,yhedra. We describe an important and difficult class of polyhedra, called configuration polytopes, that have application to determining the ground states of alloy phase diagrams. Experience gained while trying to solve these problems lead to a number of improvements to the original implementation.作者: Commodious 時間: 2025-3-31 02:16
On the Existente of a Point Subset with 4 or 5 Interior Points.) be the smallest integer such that every set of points in the plane, no three collinear, containing at least .(.) interior points has a subset of points containing . or . + 1 interior points. We proved that .(3) =3 in an earlier paper. In this paper we prove that .(4) = 7.作者: REIGN 時間: 2025-3-31 05:16
Folding and Cutting Paperf cuts. The folds are based on the straight skeleton, which lines up the desired edges by folding along various bisectors; and a collection of perpendiculars that make the crease pattern foldable. We prove that the crease pattern is flat foldable by demonstrating a family of folded states with the desired properties.作者: 手銬 時間: 2025-3-31 10:58
2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Piecesllinear, |..| = ., and |..| = .. This paper shows that Kaneko and Kano’s conjecture is true, i.e., .. ∪ .. can be partitioned into . subsets ..,..,...,.. satisfying that: (i) conv(..) ∩ conv(..) = ? for all 1 ≤ . < . ≤ .; (ii) |.. ∩ ..|= . and |.. ∩ ..| = . for all 1 ≤ . ≤ .. This is a generalization of 2-dimension Ham Sandwich Theorem.作者: JIBE 時間: 2025-3-31 15:17 作者: Tortuous 時間: 2025-3-31 18:39 作者: Hearten 時間: 2025-4-1 00:55
Jin Akiyama,Mikio Kano,Masatsugu UrabeIncludes supplementary material: 作者: thwart 時間: 2025-4-1 01:54
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/281177.jpg作者: 中和 時間: 2025-4-1 08:40 作者: Muscularis 時間: 2025-4-1 11:14 作者: NEXUS 時間: 2025-4-1 16:37 作者: 節(jié)省 時間: 2025-4-1 21:48
Living with ,yhedra. We describe an important and difficult class of polyhedra, called configuration polytopes, that have application to determining the ground states of alloy phase diagrams. Experience gained while trying to solve these problems lead to a number of improvements to the original implementation.
