Titlebook: Discrete and Computational Geometry and Graphs; 16th Japanese Confer Jin Akiyama,Hiro Ito,Toshinori Sakai Conference proceedings 2014 Sprin

縮寫

書目名稱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é)科排名

冷峻

價(jià)值在貶值

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

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

Discrete and Computational Geometry and Graphs978-3-319-13287-7Series ISSN 0302-9743 Series E-ISSN 1611-3349

Ergots

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

消瘦

否決

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

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.