缩写
发表于 2025-3-21 16:36:21
书目名称Discrete and Computational Geometry and Graphs影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0281182<br><br> <br><br>书目名称Discrete and Computational Geometry and Graphs影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0281182<br><br> <br><br>书目名称Discrete and Computational Geometry and Graphs网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0281182<br><br> <br><br>书目名称Discrete and Computational Geometry and Graphs网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0281182<br><br> <br><br>书目名称Discrete and Computational Geometry and Graphs被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0281182<br><br> <br><br>书目名称Discrete and Computational Geometry and Graphs被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0281182<br><br> <br><br>书目名称Discrete and Computational Geometry and Graphs年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0281182<br><br> <br><br>书目名称Discrete and Computational Geometry and Graphs年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0281182<br><br> <br><br>书目名称Discrete and Computational Geometry and Graphs读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0281182<br><br> <br><br>书目名称Discrete and Computational Geometry and Graphs读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0281182<br><br> <br><br>
冷峻
发表于 2025-3-21 21:06:17
http://reply.papertrans.cn/29/2812/281182/281182_2.png
价值在贬值
发表于 2025-3-22 02:27:40
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:39
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:01
Discrete and Computational Geometry and Graphs978-3-319-13287-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
Ergots
发表于 2025-3-22 14:19:30
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:58
http://reply.papertrans.cn/29/2812/281182/281182_7.png
消瘦
发表于 2025-3-23 00:48:16
http://reply.papertrans.cn/29/2812/281182/281182_8.png
否决
发表于 2025-3-23 04:04:01
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:24
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.