找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
查看: 37146|回复: 64
发表于 2025-3-21 17:57:07 | 显示全部楼层 |阅读模式
书目名称Discrete and Computational Geometry
副标题Japanese Conference,
编辑Jin Akiyama,Mikio Kano,Masatsugu Urabe
视频video
概述Includes supplementary material:
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Discrete and Computational Geometry; Japanese Conference, Jin Akiyama,Mikio Kano,Masatsugu Urabe Conference proceedings 2000 Springer-Verla
描述This volume consists of those papers presented at the Japan Conference on Discrete and Computational Geometry ’98. The conference was held 9-12 - cember 1998 at Tokai University in Tokyo. Close to a hundred participants from 10 countries participated. Interest in Computational Geometry surfaced among engineers in Japan - out twenty years ago, while interest in Discrete Geometry arose as a natural extension of the research of a group of graph theorists more recently. One of the goals of the conference was to bring together these two groups and to put them in contact with experts in these ?elds from abroad. This is the second conference in the series. The plan is to hold one every year and to publish the papers of the conferences every two years. The organizers thank the sponsors of the conference, namely, The Institute of Educational Development of Tokai University, Grant-in-Aid of the Ministry of Education of Japan (A.Saito;(A)10304008), Mitsubishi Research Institute, Sanada Institute of System Development, Japan Process, and Upward. They also thank especially T. Asano, D. Avis, V. Chv´ atal, H. Imai, J. Pach, D. R- paport, M. Ruiz, J. O’Rourke, K. Sugihara, T. Tokuyama, and J. Urr
出版日期Conference proceedings 2000
关键词Computational geometry; Graph; algorithmic geometry; combinatorial geometry; convex sets; discrete geomet
版次1
doihttps://doi.org/10.1007/b75044
isbn_softcover978-3-540-67181-7
isbn_ebook978-3-540-46515-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2000
The information of publication is updating

书目名称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读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:40:51 | 显示全部楼层
发表于 2025-3-22 03:02:35 | 显示全部楼层
发表于 2025-3-22 07:40:19 | 显示全部楼层
发表于 2025-3-22 12:11:29 | 显示全部楼层
发表于 2025-3-22 13:17:50 | 显示全部楼层
NP-Completeness of Stage Illumination Problemss completely illuminated. The problem for finding a polynomial time algorithm for this problem or proving NP-hardness of this problem was open. This paper shows that it is NP-complete even with some restrictions.
发表于 2025-3-22 19:17:44 | 显示全部楼层
On the Maximum Degree of Bipartite Embeddings of Trees in the Planertite sets . and ., i.e., .(.) = . ∪ ., then . is denoted by .(., .). Let . and . be two disjoint sets of points in the plane such that |.| = |.| and no three points of . ∪ . are tollinear. Then we show that the geometric complete bipartite graph .(., .) contains a spanning tree . without crossings such that the maximum degree of . is at most 3.
发表于 2025-3-22 22:51:09 | 显示全部楼层
Efficient Regular Polygon Dissections consider polygonal cuts, i.e., the minimum number .(4,.) of pieces needed to dissect a square into a regular n-gon of the same area using polygonal cuts and show that ., holds for sufficiently large .. We also consider regular polygon-polygon dissections and obtain similar bounds for .(.,.) and .(...).
发表于 2025-3-23 02:57:18 | 显示全部楼层
On Soddy’s Hexlet and a Linked 4-Pair6, and in any (3,6)-link, each ball in the 3-cycle is tangent to all balls in the 6-cycle, (2) a (4,4)-cycle exists and in any (4,4)-cycle, each ball in a 4-cycle is tangent to all balls in the other 4-cycle.
发表于 2025-3-23 06:17:21 | 显示全部楼层
Convex Hull Problem with Imprecise Inputthe intersection and the union of all possible convex hulls. The gap of these two hulls explicitly represents the accuracy of a possible convex hull. Under an assumption that the size of error is given for each input point, we show that the inner convex hull and the outer convex hull are calculated in .(. log .) time for . points in the plane.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-6 05:49
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表