標(biāo)題: Titlebook: Discrete and Computational Geometry; Japanese Conference, Jin Akiyama,Mikio Kano Conference proceedings 2003 Springer-Verlag Berlin Heidelb [打印本頁] 作者: 乳缽 時間: 2025-3-21 16:38
書目名稱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é)科排名
作者: 巨碩 時間: 2025-3-21 20:27
Congruent Dudeney Dissections of Polygons,lows: Hinge the parts of . like a string along the perimeter of . , then fix one of the parts to form . with the perimeter of . going into its interior and with its perimeter consisting of the dissection lines in the interior of . , without turning the surfaces over. In this paper we discuss a speci作者: 知識分子 時間: 2025-3-22 01:52
Playing with Triangulations,cting, transforming, and marking triangulations. In various situations, we develop polynomial-time algorithms to determine who wins a given game under optimal play, and to find a winning strategy. Along the way, we show connections to existing combinatorial games such as Kayles.作者: 注射器 時間: 2025-3-22 05:28 作者: 謙卑 時間: 2025-3-22 11:06 作者: cavity 時間: 2025-3-22 13:20 作者: cavity 時間: 2025-3-22 18:17
On the Minimum Perimeter Triangle Enclosing a Convex Polygon,sence of a property called the .. This property was crucial in the linear-time solution for the minimum area triangle enclosing a convex polygon. We have discovered a non-trivial interspersing property for the minimum perimeter problem. This resulted in an optimal solution to the minimum perimeter t作者: capsaicin 時間: 2025-3-22 23:35
Succinct Data Structures for Approximating Convex Functions with Applications,res requiring only . time, we explore different applications of such data structures to efficiently solve problems in clustering and facility location. Our data structures are succinct using only .((1/.)log.(.)) bits of storage. We show that this is optimal by providing a matching lower bound showin作者: LITHE 時間: 2025-3-23 03:59 作者: fulcrum 時間: 2025-3-23 08:03 作者: POLYP 時間: 2025-3-23 13:34 作者: Hallowed 時間: 2025-3-23 17:51
,Piano-Hinged Dissections: Now Let’s Fold!, used to rotate a piece . from being next to a piece . on one level to being above or below piece . on another level. Techniques are presented and analyzed for designing piano-hinged dissections. These include the use of polygon structure, the conversion from twisted-hinged dissections, the folding 作者: leniency 時間: 2025-3-23 18:33
Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon,-gon . in the plane with vertices . ., . ., ..., . . which are arranged in this order clockwisely, we let each node .?∈?. correspond to the vertex . . and define the area . .(.) of . on . by the sum of weighted areas of convex hulls for all hyperedges in .. For 0 ≤ .<.<. ≤ .-1, a convex three-cut .(作者: 競選運(yùn)動 時間: 2025-3-24 01:33 作者: legislate 時間: 2025-3-24 05:45 作者: 流眼淚 時間: 2025-3-24 06:58 作者: LIMIT 時間: 2025-3-24 13:37 作者: precede 時間: 2025-3-24 16:55
Non-Neoplastic Intestinal Disease However, not much is known about the separation problem for these inequalities. Previously Avis and Grishukhin showed that certain special cases of the separation problem for hypermetric inequalities are NP-hard, as evidence that the separation problem is itself hard. In this paper we show that sim作者: 創(chuàng)新 時間: 2025-3-24 22:18 作者: 監(jiān)禁 時間: 2025-3-25 00:07
Non-Neoplastic Intestinal Diseaseector contains 1/3 of each mass). We prove the existence of a continuum of equitable 3-cuttings that satisfy some closure property. This permits us to generalize earlier results on both convex and non-convex equitable 3-cuttings with additional constraints.作者: 使人入神 時間: 2025-3-25 04:41
Non-Neoplastic Intestinal Diseasesence of a property called the .. This property was crucial in the linear-time solution for the minimum area triangle enclosing a convex polygon. We have discovered a non-trivial interspersing property for the minimum perimeter problem. This resulted in an optimal solution to the minimum perimeter t作者: 反復(fù)拉緊 時間: 2025-3-25 07:39
Non-Neoplastic Intestinal Diseaseres requiring only . time, we explore different applications of such data structures to efficiently solve problems in clustering and facility location. Our data structures are succinct using only .((1/.)log.(.)) bits of storage. We show that this is optimal by providing a matching lower bound showin作者: palliative-care 時間: 2025-3-25 15:04 作者: Gerontology 時間: 2025-3-25 16:27 作者: Accolade 時間: 2025-3-25 20:19 作者: 托人看管 時間: 2025-3-26 00:40 作者: OUTRE 時間: 2025-3-26 07:21
https://doi.org/10.1007/978-1-4757-2548-3-gon . in the plane with vertices . ., . ., ..., . . which are arranged in this order clockwisely, we let each node .?∈?. correspond to the vertex . . and define the area . .(.) of . on . by the sum of weighted areas of convex hulls for all hyperedges in .. For 0 ≤ .<.<. ≤ .-1, a convex three-cut .(作者: GULF 時間: 2025-3-26 09:25 作者: 彩色 時間: 2025-3-26 16:14
Eisa Lari,Ali Lari,Khaled AlyaqoutWe consider a device with rectangular base having no gradations. We show that the number of directly measurable amounts of liquid using the device with its vertices as markers is always 13, independent of its shape. Then we show how the device can measure any integral amount of liquid between 1 and 858 liters.作者: 哺乳動物 時間: 2025-3-26 17:53 作者: 壁畫 時間: 2025-3-26 21:56
Non-neoplastic Intestinal DiseaseFor a planar . point set . in general position, a convex polygon of . is called empty if no point of . lies in its interior. We show that . can be always partitioned into at most ?9./34 ? empty convex polygons and that ?(.?+?1)/4 ? empty convex polygons are occasionally necessary.作者: Jejune 時間: 2025-3-27 03:17
https://doi.org/10.1007/978-1-4757-2548-3We introduce relaxed scheduling as a paradigm for mesh maintenance and demonstrate its applicability to triangulating a skin surface in ?..作者: 南極 時間: 2025-3-27 06:54
Non-neoplastic Intestinal DiseaseAn arrangement of . lines chosen at random from . . has a vertex set whose convex hull has constant (expected) size.作者: Militia 時間: 2025-3-27 13:26
Universal Measuring Devices with Rectangular Base,We consider a device with rectangular base having no gradations. We show that the number of directly measurable amounts of liquid using the device with its vertices as markers is always 13, independent of its shape. Then we show how the device can measure any integral amount of liquid between 1 and 858 liters.作者: sundowning 時間: 2025-3-27 14:53 作者: 細(xì)絲 時間: 2025-3-27 20:20
Partitioning a Planar Point Set into Empty Convex Polygons,For a planar . point set . in general position, a convex polygon of . is called empty if no point of . lies in its interior. We show that . can be always partitioned into at most ?9./34 ? empty convex polygons and that ?(.?+?1)/4 ? empty convex polygons are occasionally necessary.作者: biopsy 時間: 2025-3-28 00:29
Relaxed Scheduling in Dynamic Skin Triangulation,We introduce relaxed scheduling as a paradigm for mesh maintenance and demonstrate its applicability to triangulating a skin surface in ?..作者: LIKEN 時間: 2025-3-28 05:27 作者: Recess 時間: 2025-3-28 07:11
https://doi.org/10.1007/b11261Maxima; Triangulation; algorithm; algorithmic geometry; algorithms; combinatorial mathematics; complexity; 作者: Pantry 時間: 2025-3-28 14:17 作者: 不可接觸 時間: 2025-3-28 15:09 作者: 易于 時間: 2025-3-28 19:09 作者: ARIA 時間: 2025-3-29 01:18
Playing with Triangulations,cting, transforming, and marking triangulations. In various situations, we develop polynomial-time algorithms to determine who wins a given game under optimal play, and to find a winning strategy. Along the way, we show connections to existing combinatorial games such as Kayles.作者: Vaginismus 時間: 2025-3-29 03:11
Constrained Equitable 3-Cuttings,ector contains 1/3 of each mass). We prove the existence of a continuum of equitable 3-cuttings that satisfy some closure property. This permits us to generalize earlier results on both convex and non-convex equitable 3-cuttings with additional constraints.作者: 討厭 時間: 2025-3-29 08:01
On the Minimum Perimeter Triangle Enclosing a Convex Polygon,sence of a property called the .. This property was crucial in the linear-time solution for the minimum area triangle enclosing a convex polygon. We have discovered a non-trivial interspersing property for the minimum perimeter problem. This resulted in an optimal solution to the minimum perimeter triangle problem.作者: 無法治愈 時間: 2025-3-29 13:28 作者: 不溶解 時間: 2025-3-29 18:34 作者: heckle 時間: 2025-3-29 21:23
Discrete and Computational Geometry978-3-540-44400-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: wangle 時間: 2025-3-30 00:16
0302-9743 Overview: Includes supplementary material: 978-3-540-20776-4978-3-540-44400-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: finite 時間: 2025-3-30 07:22 作者: NUL 時間: 2025-3-30 12:12 作者: 顯而易見 時間: 2025-3-30 12:31 作者: Tempor 時間: 2025-3-30 20:26 作者: 不容置疑 時間: 2025-3-31 00:45
https://doi.org/10.1007/978-1-4757-2548-3n of their bars from an initial configuration to a “straight line segment,” preserving the length of each bar and not crossing any two bars. In this paper, we introduce a new class of linkages, called “radial trees,” and show that there exists a radial tree which can not be flattened.作者: Evacuate 時間: 2025-3-31 03:56 作者: ureter 時間: 2025-3-31 05:55 作者: 透明 時間: 2025-3-31 13:11
Non-Neoplastic Intestinal Disease. Our data structures are succinct using only .((1/.)log.(.)) bits of storage. We show that this is optimal by providing a matching lower bound showing that any data structure providing such an .-approximation requires at least Ω((1/.)log.(.)) bits of storage.作者: 階層 時間: 2025-3-31 16:47
https://doi.org/10.1007/978-1-4757-2548-3nsional faces, we prove that the description of . . given in [9] is complete with 1 550 825 000 vertices and that the . conjecture [16] holds for .≤ 8. Computational issues for the orbitwise face and vertex enumeration algorithms are also discussed.作者: 低能兒 時間: 2025-3-31 18:07
https://doi.org/10.1007/978-1-4757-2548-3dges .?∈?. such that . contains at least one node from each of {., ..., .???1}, {., ..., .???1} and {., ..., .???1, 0, ..., .???1 }. We show that for two hypergraphs . and .′ on ., the following two conditions are equivalent.作者: 一罵死割除 時間: 2025-3-31 22:18
On the Face Lattice of the Metric Polytope,nsional faces, we prove that the description of . . given in [9] is complete with 1 550 825 000 vertices and that the . conjecture [16] holds for .≤ 8. Computational issues for the orbitwise face and vertex enumeration algorithms are also discussed.作者: 難聽的聲音 時間: 2025-4-1 04:08
Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon,dges .?∈?. such that . contains at least one node from each of {., ..., .???1}, {., ..., .???1} and {., ..., .???1, 0, ..., .???1 }. We show that for two hypergraphs . and .′ on ., the following two conditions are equivalent.作者: Armada 時間: 2025-4-1 08:06 作者: 整體 時間: 2025-4-1 11:34
On Partitioning a Cake,es. It is known [4, 5, 9] that any two masses have convex .-partition for .=(1/3,1/3,1/3). We prove the existence of convex .-partitions for any .=(.,.,1-2.), 0<.<1/3. We also provide an infinite family of . each of which does not guarantee a convex .-partition of a cake.作者: FRONT 時間: 2025-4-1 15:43
Succinct Data Structures for Approximating Convex Functions with Applications,. Our data structures are succinct using only .((1/.)log.(.)) bits of storage. We show that this is optimal by providing a matching lower bound showing that any data structure providing such an .-approximation requires at least Ω((1/.)log.(.)) bits of storage.
