找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Discrete and Computational Geometry; Japanese Conference, Jin Akiyama,Mikio Kano,Xuehou Tan Conference proceedings 2005 Springer-Verlag Ber

[復制鏈接]
查看: 54100|回復: 61
樓主
發(fā)表于 2025-3-21 17:21:19 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Discrete and Computational Geometry
副標題Japanese Conference,
編輯Jin Akiyama,Mikio Kano,Xuehou Tan
視頻videohttp://file.papertrans.cn/282/281180/281180.mp4
叢書名稱Lecture Notes in Computer Science
圖書封面Titlebook: Discrete and Computational Geometry; Japanese Conference, Jin Akiyama,Mikio Kano,Xuehou Tan Conference proceedings 2005 Springer-Verlag Ber
出版日期Conference proceedings 2005
關鍵詞algorithm; algorithmic geometry; algorithms; approximation; combinatorial mathematics; computational geom
版次1
doihttps://doi.org/10.1007/11589440
isbn_softcover978-3-540-30467-8
isbn_ebook978-3-540-32089-0Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2005
The information of publication is updating

書目名稱Discrete and Computational Geometry影響因子(影響力)




書目名稱Discrete and Computational Geometry影響因子(影響力)學科排名




書目名稱Discrete and Computational Geometry網(wǎng)絡公開度




書目名稱Discrete and Computational Geometry網(wǎng)絡公開度學科排名




書目名稱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

您所在的用戶組沒有投票權限
沙發(fā)
發(fā)表于 2025-3-22 00:00:53 | 只看該作者
The Role of Liver Transplantationotal length. We present an optimal algorithm solving the problem in linear time if the edges incident to . are sorted clockwise by angle. For unsorted edges our algorithm runs in .(. log .) time. For unsorted edges we also give a linear time approximation algorithm and a lower time bound.
板凳
發(fā)表于 2025-3-22 02:03:58 | 只看該作者
地板
發(fā)表于 2025-3-22 05:45:48 | 只看該作者
Thoracic Aorta and Its Variantsdean rigidity results regarding the existence and combinatorial characterization of expansive motions. In particular, we extend the concept of a pseudo-triangulation from the Euclidean to the spherical case. As a consequence, we formulate a set of . that must be satisfied by three-dimensional generalizations of pointed pseudo-triangulations.
5#
發(fā)表于 2025-3-22 12:23:54 | 只看該作者
The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation,known whether it is NP-hard to compute minimum Manhattan networks, i.e. Manhattan networks of minimum total length. In this paper we present a factor-3 approximation algorithm for this problem. Given a set of . nodes, our algorithm takes .(. log .) time and linear space.
6#
發(fā)表于 2025-3-22 13:42:47 | 只看該作者
7#
發(fā)表于 2025-3-22 17:25:34 | 只看該作者
A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem,vex pieces. We give a fixed-parameter tractable algorithm for this problem that runs in the following time complexities:.– linear time if . is constant,.– time polynomial in . if .,.or, to be exact, in .(. . . . . 2.) time.
8#
發(fā)表于 2025-3-23 00:16:45 | 只看該作者
9#
發(fā)表于 2025-3-23 03:55:17 | 只看該作者
10#
發(fā)表于 2025-3-23 05:59:47 | 只看該作者
https://doi.org/10.1007/978-981-99-5808-5oves under different assumptions on disk radii and disk placements. For example, with . congruent disks, . moves always suffice for transforming the start configuration into the target configuration; on the other hand, . moves are sometimes necessary.
 關于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結 SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-31 00:28
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
高要市| 丘北县| 南阳市| 鲁甸县| 无棣县| 淮阳县| 溆浦县| 东丰县| 南陵县| 沁源县| 金堂县| 安溪县| 长武县| 丹江口市| 霍林郭勒市| 浙江省| 灌阳县| 鄄城县| 江门市| 隆回县| 棋牌| 庆云县| 门源| 曲阜市| 南投县| 张家口市| 修武县| 洱源县| 黄骅市| 永泰县| 平江县| 大足县| 玛曲县| 贺兰县| 长沙县| 北安市| 宜都市| 涪陵区| 邯郸市| 顺平县| 离岛区|