標(biāo)題: Titlebook: Discrete and Computational Geometry and Graphs; 16th Japanese Confer Jin Akiyama,Hiro Ito,Toshinori Sakai Conference proceedings 2014 Sprin [打印本頁] 作者: 縮寫 時間: 2025-3-21 16:36
書目名稱Discrete and Computational Geometry and Graphs影響因子(影響力)
書目名稱Discrete and Computational Geometry and Graphs影響因子(影響力)學(xué)科排名
書目名稱Discrete and Computational Geometry and Graphs網(wǎng)絡(luò)公開度
書目名稱Discrete and Computational Geometry and Graphs網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Discrete and Computational Geometry and Graphs被引頻次
書目名稱Discrete and Computational Geometry and Graphs被引頻次學(xué)科排名
書目名稱Discrete and Computational Geometry and Graphs年度引用
書目名稱Discrete and Computational Geometry and Graphs年度引用學(xué)科排名
書目名稱Discrete and Computational Geometry and Graphs讀者反饋
書目名稱Discrete and Computational Geometry and Graphs讀者反饋學(xué)科排名
作者: 冷峻 時間: 2025-3-21 21:06 作者: 價值在貶值 時間: 2025-3-22 02:27
Panagiotis Karampelas,Thirimachos Bourlaihave the same structure as .-geodesics, and to show that properties of .-geodesics follow from their discrete analogues as a limiting case, thereby providing a new, and arguably simpler, “discrete” proof of the Dubins characterization. Our focus, in this paper, is on paths that have non-negative mea作者: delusion 時間: 2025-3-22 06:41
Military Conflict among the Elitetime bound. A polygonal region is searchable by a searcher if the searcher can detect (or see) an . intruder inside the region, no matter how fast the intruder moves. A .. holds . flashlights and can see only along the rays of the flashlights emanating from his position. Our result can also be used 作者: ABOUT 時間: 2025-3-22 11:39
Discrete and Computational Geometry and Graphs978-3-319-13287-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Ergots 時間: 2025-3-22 14:19
Correction of Airborne IR-Scanner Data number of guards with .-visibility in a polyomino with holes is NP-hard. Here, two points?. and . on a polyomino are . if the orthogonal bounding rectangle for . and . lies entirely within the polyomino. As a corollary, locating the minimum number of guards with .-visibility in an orthogonal polygon with holes is NP-hard.作者: Ergots 時間: 2025-3-22 18:17 作者: 消瘦 時間: 2025-3-23 00:48 作者: 否決 時間: 2025-3-23 04:04
On Wrapping Spheres and Cubes with Rectangular Paper,What is the largest cube or sphere that a given rectangular piece of paper can wrap? This natural problem, which has plagued gift-wrappers everywhere, remains very much unsolved. Here we introduce new upper and lower bounds and consolidate previous results. Though these bounds rarely match, our results significantly reduce the gap.作者: white-matter 時間: 2025-3-23 07:12
Imaginary Hypercubes,Imaginary cubes are three-dimensional objects that have square projections in three orthogonal ways, just like a cube has. In this paper, we introduce higher-dimensional extensions of imaginary cubes and study their properties.作者: 無瑕疵 時間: 2025-3-23 09:47 作者: entrance 時間: 2025-3-23 14:05 作者: Hyperlipidemia 時間: 2025-3-23 21:28 作者: Shuttle 時間: 2025-3-24 01:30 作者: 過度 時間: 2025-3-24 04:59
Fundamentals of Atmospheric Spectroscopye to place it on the unit circle in .. The objective is to set the center of mass of the placed weights as close to the origin as possible. We apply competitive analysis defining the competitive difference as a performance measure. We first present an optimal strategy for placing unit weights which 作者: 引起痛苦 時間: 2025-3-24 08:11
Fundamentals of Remote Sensing Methodology . with hinges (which compose a dissection tree), . is called . to ., and if the surface of . is transformed to the interior of . except some edges of pieces, . is called . to .. Let . be a reflective space-filler in the 3-space and let . be a mirror image of .. In this paper, we show that any conve作者: oxidant 時間: 2025-3-24 14:31 作者: 脫水 時間: 2025-3-24 17:43
Surveillance and Spectacle Inside stence of a non-crossing properly colored geometric perfect matching on . (if . is even), and the existence of a non-crossing properly colored geometric spanning tree with maximum degree at most . on .. Moreover, we show the existence of a non-crossing properly colored geometric perfect matching in 作者: 抱負(fù) 時間: 2025-3-24 19:38 作者: appall 時間: 2025-3-25 02:09 作者: Osteons 時間: 2025-3-25 05:59 作者: 徹底檢查 時間: 2025-3-25 09:18
https://doi.org/10.1057/9780230373020ble to manage a huge amount of visual data, can understand the scenes in front of them, and thus can survive in their daily lives. We use visual illusions to investigate how the human brain treats geometric data, and we point out the similarities between the robustness of human geometric processing 作者: Certainty 時間: 2025-3-25 12:43
Military Conflict among the Elitegon . is ... if there are two points ., . on the boundary of . such that every point on the clockwise boundary of . from . to . is link-2 visible from some point of the other boundary of . from . to . and vice versa. We give a characterization of link-2 .-visibility polygons by generalizing the know作者: 專心 時間: 2025-3-25 17:14 作者: 努力趕上 時間: 2025-3-25 21:10 作者: SEED 時間: 2025-3-26 02:54
Conference proceedings 2014Graphs, JDCDGG 2013, held in Tokyo, Japan, in September 2013..The total of 16 papers included in this volume was carefully reviewed and selected from 58 submissions. The papers feature advances made in the field of computational geometry and focus on emerging technologies, new methodology and applications, graph theory and dynamics..作者: Brochure 時間: 2025-3-26 06:39
https://doi.org/10.1007/978-3-319-13287-7NP-hard; affine equivalence; algorithmic geometry; approximation; brain computing; convex polygons; discre作者: 序曲 時間: 2025-3-26 09:31
978-3-319-13286-0Springer International Publishing Switzerland 2014作者: Override 時間: 2025-3-26 15:02 作者: PAEAN 時間: 2025-3-26 18:42
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/281182.jpg作者: 協(xié)定 時間: 2025-3-27 00:29 作者: Decrepit 時間: 2025-3-27 04:36
The Non-confusing Travel Groupoids on a Finite Connected Graph,t . and a binary operation . on . satisfying two axioms. For a travel groupoid, we can associate a graph. We say that a graph . has a travel groupoid if the graph associated with the travel groupoid is equal to .. A travel groupoid is said to be non-confusing if it has no confusing pairs. Nebesky sh作者: 粘 時間: 2025-3-27 07:47 作者: Needlework 時間: 2025-3-27 13:19 作者: 痛苦一下 時間: 2025-3-27 14:13 作者: 頑固 時間: 2025-3-27 17:51
Transformability and Reversibility of Unfoldings of Doubly-Covered Polyhedra, . with hinges (which compose a dissection tree), . is called . to ., and if the surface of . is transformed to the interior of . except some edges of pieces, . is called . to .. Let . be a reflective space-filler in the 3-space and let . be a mirror image of .. In this paper, we show that any conve作者: Gustatory 時間: 2025-3-27 22:45 作者: sultry 時間: 2025-3-28 02:44
Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plstence of a non-crossing properly colored geometric perfect matching on . (if . is even), and the existence of a non-crossing properly colored geometric spanning tree with maximum degree at most . on .. Moreover, we show the existence of a non-crossing properly colored geometric perfect matching in 作者: 敲詐 時間: 2025-3-28 08:20 作者: 滋養(yǎng) 時間: 2025-3-28 12:24 作者: 同謀 時間: 2025-3-28 18:25 作者: Projection 時間: 2025-3-28 18:44
Computational Geometry in the Human Brain,ble to manage a huge amount of visual data, can understand the scenes in front of them, and thus can survive in their daily lives. We use visual illusions to investigate how the human brain treats geometric data, and we point out the similarities between the robustness of human geometric processing 作者: 鞠躬 時間: 2025-3-29 01:03
A Characterization of Link-2 LR-visibility Polygons with Applications,gon . is ... if there are two points ., . on the boundary of . such that every point on the clockwise boundary of . from . to . is link-2 visible from some point of the other boundary of . from . to . and vice versa. We give a characterization of link-2 .-visibility polygons by generalizing the know作者: MARS 時間: 2025-3-29 06:53
More Results on Clique-chromatic Numbers of Graphs with No Long Path,nochromatic. In 2003, Gravier, Hoang, and Maffray have shown that, for any graph ., the class of .-free graphs has a bounded clique-chromatic number if and only if . is a vertex-disjoint union of paths, and they give an upper bound for all such cases. In this paper, their bounds for . and . with . a作者: 雜色 時間: 2025-3-29 11:06
Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plic spanning tree with maximum degree at most . on .. Moreover, we show the existence of a non-crossing properly colored geometric perfect matching in the plane lattice. In order to prove these our results, we propose an useful lemma that gives a good partition of a sequence of multicolored points.作者: 集聚成團(tuán) 時間: 2025-3-29 11:36 作者: 壟斷 時間: 2025-3-29 18:44 作者: inflame 時間: 2025-3-29 21:30
More Results on Clique-chromatic Numbers of Graphs with No Long Path,f and only if . is a vertex-disjoint union of paths, and they give an upper bound for all such cases. In this paper, their bounds for . and . with . are significantly reduced to . and . respectively, and sharp bounds are given for some subclasses.作者: Accolade 時間: 2025-3-30 01:04 作者: occurrence 時間: 2025-3-30 06:31 作者: extemporaneous 時間: 2025-3-30 10:28 作者: GREEN 時間: 2025-3-30 12:36 作者: 神秘 時間: 2025-3-30 19:38
Separation and Parenting a Surrogate Baby For several such special cases, we give upper and lower bounds on the minimum size of a covering by zones. We also consider the computational complexity of those problems, and establish some hardness results.
