Titlebook: Discrete and Computational Geometry; Japanese Conference, Jin Akiyama,Mikio Kano,Masatsugu Urabe Conference proceedings 2001 Springer-Verla

使委屈

書目名稱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讀者反饋學科排名

jet-lag

單獨

隱藏

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

CYN

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

anagen

Kaleidoscope

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.

易受刺激

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