標(biāo)題: Titlebook: Discrete and Computational Geometry; Japanese Conference, Jin Akiyama,Mikio Kano,Masatsugu Urabe Conference proceedings 2001 Springer-Verla [打印本頁] 作者: 使委屈 時(shí)間: 2025-3-21 19:39
書目名稱Discrete and Computational Geometry影響因子(影響力)
書目名稱Discrete and Computational Geometry影響因子(影響力)學(xué)科排名
書目名稱Discrete and Computational Geometry網(wǎng)絡(luò)公開度
書目名稱Discrete and Computational Geometry網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Discrete and Computational Geometry被引頻次
書目名稱Discrete and Computational Geometry被引頻次學(xué)科排名
書目名稱Discrete and Computational Geometry年度引用
書目名稱Discrete and Computational Geometry年度引用學(xué)科排名
書目名稱Discrete and Computational Geometry讀者反饋
書目名稱Discrete and Computational Geometry讀者反饋學(xué)科排名
作者: jet-lag 時(shí)間: 2025-3-21 23:33 作者: 單獨(dú) 時(shí)間: 2025-3-22 00:57 作者: 隱藏 時(shí)間: 2025-3-22 05:03
Gregory J. Mancini,Dennis R. Van Dorpally has gradations marked on its sides. In this paper we study measuring devices without gradations but which nevertheless can measure any integral amount, say liters, of liquid up to their full capacity. These devices will be called ... We determine the largest volume of measuring device with tria作者: Adenoma 時(shí)間: 2025-3-22 10:41 作者: CYN 時(shí)間: 2025-3-22 13:34
Selection of Bariatric Proceduresto form . polygons ..,...,.. all similar to .. If for every ., 1 ≤ . ≤ ., the pieces of . can be assembled into . polygons, all similar to ., then . is called a sequentially .-divisible dissection. In this paper we show that any convex .-gon, . ≤ 5, has a sequentially .-divisible dissection with (. 作者: CYN 時(shí)間: 2025-3-22 20:27 作者: anagen 時(shí)間: 2025-3-22 22:16 作者: Kaleidoscope 時(shí)間: 2025-3-23 01:26
Selection of Bariatric Procedureson of Ramsey’s theorem then yields the classical Erd?s-Szekeres theorem [.]: For every integer . ≥ 3 there is an N. such that, among any set of . ≥ .. points in general position in the plane, there is the vertex set of a convex n-gon. Let . denote the smallest such number.作者: 易受刺激 時(shí)間: 2025-3-23 05:52
https://doi.org/10.1007/978-1-4471-1942-5sional space, and some related problems like the largest repeated or .-fold repeated subsets. For the maximum-cardinality symmetric subset problem in the plane I show a connection to the maximum number of isosceles triangles among . points in the planel; if this number is denoted by . this gives an 作者: 圓錐體 時(shí)間: 2025-3-23 13:34
The Link with Medical Management,ly. Over the past few years, there has been a surge of interest in these problems in discrete and computationsl geometry. This paper gives a brief survey of some of the recent work in this area, subdivided into three sections based on the type of object being folded: linkages, paper, or polyhedra. S作者: AGOG 時(shí)間: 2025-3-23 15:08
https://doi.org/10.1007/978-1-4471-1942-5the description of the metric polytope is easy as .. has at most 544 vertices partitioned into 3 orbits; .. - the largest previously known instance - has 275 840 vertices but only 13 orbits. Using its large symmetry group, we enumerate orbitwise 1 550 825 600 vertices of the 28-dimensional metric po作者: 建筑師 時(shí)間: 2025-3-23 20:12
The Link with Medical Management,hird dimension. Techniques are presented and analyzed for designing hingeable dissections that use either only swings hinges or only twist hinges. For swing hinges these include the superposition of tessellations, the crossposition of T-strips, and the exploitation of the structure of regular polygo作者: Bone-Scan 時(shí)間: 2025-3-23 23:59 作者: Amylase 時(shí)間: 2025-3-24 04:22
M. Rothmund,D. Bartsch,W. Lorenzlyhedron, determine the volume and the area of the portion of the polyhedron above .. The queries are answered in a time linear in the size (complexity) of .. The space and preprocessing time for this dara structure are linear in the size of .. We also present an intermediary data structure for plan作者: 明智的人 時(shí)間: 2025-3-24 07:25
R. Lefering,E. A. M. Neugebauer, 1, ..., .-1}. Consider a graph drawing of . such that each vertex . ∈ . is represented by .. and each edge (.) ∈ . is drawn by a straight line segment. Denote the sum of lengths of graph edges in such drawing by .. (.). If .. (.) ≤ .. (.′) for any convex .-gon ., then we write as . ?..′. This pape作者: 粘 時(shí)間: 2025-3-24 13:10 作者: 華而不實(shí) 時(shí)間: 2025-3-24 15:35
J. Hobbhahn,K. Peter,A. E. Goetz,P. Conzenplane, respectively, such that no three points of .∪. lie on the same line. Let . = .. + .. + ... + .. be an integer-partition of n such that 1 ≤ .. for every 1 ≤ . ≤ .. Then we want to partition . ∪ . into . disjoint subsets .. ∪ .. ∪ ... ∪ .. that satisfy the following two conditions: (.) conv (..作者: collagen 時(shí)間: 2025-3-24 20:29 作者: Inculcate 時(shí)間: 2025-3-25 02:32
Computer Applications in Surgical Research a relation of this problem to a certain extreme packing problem. Based on this relationship, we develop a heuristic producing 6-approximation for spheres (provided n is chosen sufficiently large). That is, the produced triangular mesh is . in this respect..The method is easy to implement and runs i作者: sclera 時(shí)間: 2025-3-25 06:47 作者: 飲料 時(shí)間: 2025-3-25 07:49 作者: Console 時(shí)間: 2025-3-25 13:15
0302-9743 Overview: Includes supplementary material: 978-3-540-42306-5978-3-540-47738-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 秘方藥 時(shí)間: 2025-3-25 16:57
Selection of Bariatric Procedureson of Ramsey’s theorem then yields the classical Erd?s-Szekeres theorem [.]: For every integer . ≥ 3 there is an N. such that, among any set of . ≥ .. points in general position in the plane, there is the vertex set of a convex n-gon. Let . denote the smallest such number.作者: 六邊形 時(shí)間: 2025-3-25 21:40
The Link with Medical Management,e polygon, ., and every point from . is on the boundary of .. Let . denote the minimum number of cells in such a partition of .. Let . be defined as the maximum value of . when . has . points. In this paper we show that ?(. - 1)/4? ≤ .(.) ≤ ?(3. - 2)/5? .作者: Coronary 時(shí)間: 2025-3-26 01:50
Computer Applications in Surgical Research a relation of this problem to a certain extreme packing problem. Based on this relationship, we develop a heuristic producing 6-approximation for spheres (provided n is chosen sufficiently large). That is, the produced triangular mesh is . in this respect..The method is easy to implement and runs in .(..) time and . space.作者: GRAIN 時(shí)間: 2025-3-26 07:58 作者: 腐敗 時(shí)間: 2025-3-26 08:36
978-3-540-42306-5Springer-Verlag Berlin Heidelberg 2001作者: buoyant 時(shí)間: 2025-3-26 15:51 作者: FILTH 時(shí)間: 2025-3-26 17:26
On Convex Decompositions of Pointse polygon, ., and every point from . is on the boundary of .. Let . denote the minimum number of cells in such a partition of .. Let . be defined as the maximum value of . when . has . points. In this paper we show that ?(. - 1)/4? ≤ .(.) ≤ ?(3. - 2)/5? .作者: Obliterate 時(shí)間: 2025-3-26 22:51
Approximating Uniform Triangular Meshes for Spheres a relation of this problem to a certain extreme packing problem. Based on this relationship, we develop a heuristic producing 6-approximation for spheres (provided n is chosen sufficiently large). That is, the produced triangular mesh is . in this respect..The method is easy to implement and runs in .(..) time and . space.作者: 嘮叨 時(shí)間: 2025-3-27 02:37 作者: 圣人 時(shí)間: 2025-3-27 06:41 作者: Fulsome 時(shí)間: 2025-3-27 11:21 作者: 鐵塔等 時(shí)間: 2025-3-27 16:51 作者: 邪惡的你 時(shí)間: 2025-3-27 19:57 作者: FEAT 時(shí)間: 2025-3-27 23:50
Geometric Dissections that Swing and Twistns and stars. For twist hinges these include the conversion of swing hinges, the P-twist for parallelograms, and completing the pseudo-tesellation. Open problems relating to the possible universality of such hingings are posed.作者: HUMID 時(shí)間: 2025-3-28 04:45
Generalized Balanced Partitions of Two Sets of Points in the Plane) ∩ conv (..) = ? for all 1 ≤ . < . ≤ ., where conv(..) denotes the convex hull of ..; and (.) each .. contains exactly .. red points and .. blue points for every 1 ≤ . ≤ ...We shall prove that the above partition exists in the case where (i) 2 ≤ . ≤ 8 and 1 ≤ .. ≤ ./2 for every 1 ≤ . ≤ ., and (ii) .. = .. = ... = .. = 2 and .. =1.作者: 食道 時(shí)間: 2025-3-28 07:37
Transabdominal Preperitoneal (TAPP) Repairposes two restrictions, one based on the reversal of the perimeter (surface area) and the interior (cross-section) of the polygon (polyhedron), and the other based on the hingeability of parts. In this paper, we survey main results on Dudeney dissections of polygons and polyhedrons.作者: 皺痕 時(shí)間: 2025-3-28 13:57 作者: 注視 時(shí)間: 2025-3-28 18:17
Selection of Bariatric Procedures, we close these gaps by improving the lower bounds. We construct an example of a scene .(....) orthographic views, and another with .(....) perspective views. Our construction can also be used to improve the known lower bounds for the number of silhouette views and for the number of distinct views from a viewpoint moving along a straight line.作者: 饒舌的人 時(shí)間: 2025-3-28 20:54 作者: INCUR 時(shí)間: 2025-3-29 01:13
The Link with Medical Management,vey of some of the recent work in this area, subdivided into three sections based on the type of object being folded: linkages, paper, or polyhedra. See also [O’R98] for a related survey from this conference two years ago.作者: JAUNT 時(shí)間: 2025-3-29 06:03 作者: 人工制品 時(shí)間: 2025-3-29 08:45
R. Lefering,E. A. M. Neugebauernt. Denote the sum of lengths of graph edges in such drawing by .. (.). If .. (.) ≤ .. (.′) for any convex .-gon ., then we write as . ?..′. This paper shows two necessary and sufficient conditions of . ?..′. Moreover, these conditions can be calculated in polynomial time for any given . and ..作者: SKIFF 時(shí)間: 2025-3-29 15:08 作者: Deceit 時(shí)間: 2025-3-29 15:42 作者: 浪費(fèi)物質(zhì) 時(shí)間: 2025-3-29 19:46
Charles R. Doarn,Gerald R. Mosesmber (possibly zero) of illegal edges are replaced by a single edge. Our algorithm reaches the Delaunay triangulation of a set . of . sites .(..) time. If the elements of . are the vertices of a convex polygon our algorithm is very efficient.作者: Amnesty 時(shí)間: 2025-3-30 03:41
https://doi.org/10.1007/978-1-4471-1942-5appears to be one of the main features of the skeleton of .., we conjecture that the cut vertices do not form a cut-set. The combinatorial and computational applications of this conjecture are studied. In particular, a heuristic skipping the highest degeneracy is presented.作者: Antagonist 時(shí)間: 2025-3-30 04:33 作者: 舊石器時(shí)代 時(shí)間: 2025-3-30 11:30 作者: 保守黨 時(shí)間: 2025-3-30 16:27 作者: Creatinine-Test 時(shí)間: 2025-3-30 16:58
On the Number of Views of Polyhedral Scenes, we close these gaps by improving the lower bounds. We construct an example of a scene .(....) orthographic views, and another with .(....) perspective views. Our construction can also be used to improve the known lower bounds for the number of silhouette views and for the number of distinct views from a viewpoint moving along a straight line.作者: Bridle 時(shí)間: 2025-3-30 21:16 作者: Electrolysis 時(shí)間: 2025-3-31 02:50 作者: LAY 時(shí)間: 2025-3-31 07:39 作者: NATAL 時(shí)間: 2025-3-31 10:13 作者: Handedness 時(shí)間: 2025-3-31 16:53
On double bound graphs with respect to graph operationsons. For example, The Cartesian product . × . of two graphs . and . is a DB-graph if and only if both . and . are bipartite graphs, the corona . o . of two graphs . and . is a DB-graph if and only if . is a bipartite graph and . is a UB-graph, and the middle graph . of a graph . is a DB-graph if and only if . is an even cycle or a path, etc.作者: CLAMP 時(shí)間: 2025-3-31 21:25
On Paths in a Complete Bipartite Geometric Graphtraight-line segment. We prove that (i) If |. (. + 1)(2. - 4)+1, then the geometric complete bipartite graph . contains a path that passes through all the points in . and has no crossings; and (ii) There exists a configuration of . ∪ . with . such that in . every path containing the set . has at least one crossing.作者: SENT 時(shí)間: 2025-3-31 23:43 作者: nutrients 時(shí)間: 2025-4-1 03:29 作者: 使困惑 時(shí)間: 2025-4-1 08:58 作者: trigger 時(shí)間: 2025-4-1 11:16
J. Hobbhahn,K. Peter,A. E. Goetz,P. Conzen) ∩ conv (..) = ? for all 1 ≤ . < . ≤ ., where conv(..) denotes the convex hull of ..; and (.) each .. contains exactly .. red points and .. blue points for every 1 ≤ . ≤ ...We shall prove that the above partition exists in the case where (i) 2 ≤ . ≤ 8 and 1 ≤ .. ≤ ./2 for every 1 ≤ . ≤ ., and (ii) .. = .. = ... = .. = 2 and .. =1.作者: 積習(xí)難改 時(shí)間: 2025-4-1 17:32 作者: kyphoplasty 時(shí)間: 2025-4-1 21:36
Universal Measuring Devices Without Gradationsally has gradations marked on its sides. In this paper we study measuring devices without gradations but which nevertheless can measure any integral amount, say liters, of liquid up to their full capacity. These devices will be called ... We determine the largest volume of measuring device with tria作者: floodgate 時(shí)間: 2025-4-2 00:18
A Note on the Purely Recursive Dissection for a Sequentially ,-Divisible Squareged to form two squares, three squares, and so on, up to . squares successively. A dissection is called . iff . more pieces needed to increase the maximum number . of composed squares by one. Ozawa found a general dissection of type-3, while Akiyama and Nakamura found a particular, “purely recursive
