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

显示全部楼层 · 发表于 2025-3-21 19:39:02

书目名称Discrete and Computational Geometry影响因子(影响力)

书目名称Discrete and Computational Geometry影响因子(影响力)学科排名

书目名称Discrete and Computational Geometry网络公开度

书目名称Discrete and Computational Geometry网络公开度学科排名

书目名称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 23:33:55

显示全部楼层 · 发表于 2025-3-22 00:57:54

显示全部楼层 · 发表于 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

显示全部楼层 · 发表于 2025-3-22 10:41:25

显示全部楼层 · 发表于 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 (.

显示全部楼层 · 发表于 2025-3-22 20:27:44

显示全部楼层 · 发表于 2025-3-22 22:16:44

显示全部楼层 · 发表于 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

		自动登录	找回密码
密码			To register

关于派博传思			派博传思旗下网站			友情链接
派博传思介绍	公司地理位置	论文服务流程	影响因子官网	吾爱论文网	大讲堂	北京大学	Oxford Uni.	Harvard Uni.
发展历史沿革	期刊点评	投稿经验总结	SCIENCEGARD	IMPACTFACTOR	派博系数	清华大学	Yale Uni.	Stanford Uni.
\|Archiver\|手机版\|小黑屋\| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-10-30 11:17
Copyright © 2001-2015 派博传思京公网安备110108008328 版权所有 All rights reserved