使委屈
发表于 2025-3-21 19:39:02
书目名称Discrete and Computational Geometry影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0281178<br><br> <br><br>书目名称Discrete and Computational Geometry影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0281178<br><br> <br><br>书目名称Discrete and Computational Geometry网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0281178<br><br> <br><br>书目名称Discrete and Computational Geometry网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0281178<br><br> <br><br>书目名称Discrete and Computational Geometry被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0281178<br><br> <br><br>书目名称Discrete and Computational Geometry被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0281178<br><br> <br><br>书目名称Discrete and Computational Geometry年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0281178<br><br> <br><br>书目名称Discrete and Computational Geometry年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0281178<br><br> <br><br>书目名称Discrete and Computational Geometry读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0281178<br><br> <br><br>书目名称Discrete and Computational Geometry读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0281178<br><br> <br><br>
jet-lag
发表于 2025-3-21 23:33:55
http://reply.papertrans.cn/29/2812/281178/281178_2.png
单独
发表于 2025-3-22 00:57:54
http://reply.papertrans.cn/29/2812/281178/281178_3.png
隐藏
发表于 2025-3-22 05:03:02
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
发表于 2025-3-22 10:41:25
http://reply.papertrans.cn/29/2812/281178/281178_5.png
CYN
发表于 2025-3-22 13:34:25
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
发表于 2025-3-22 20:27:44
http://reply.papertrans.cn/29/2812/281178/281178_7.png
anagen
发表于 2025-3-22 22:16:44
http://reply.papertrans.cn/29/2812/281178/281178_8.png
Kaleidoscope
发表于 2025-3-23 01:26:33
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.
易受刺激
发表于 2025-3-23 05:52:47
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