帐簿
发表于 2025-3-21 17:57:07
书目名称Discrete and Computational Geometry影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0281177<br><br> <br><br>书目名称Discrete and Computational Geometry影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0281177<br><br> <br><br>书目名称Discrete and Computational Geometry网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0281177<br><br> <br><br>书目名称Discrete and Computational Geometry网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0281177<br><br> <br><br>书目名称Discrete and Computational Geometry被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0281177<br><br> <br><br>书目名称Discrete and Computational Geometry被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0281177<br><br> <br><br>书目名称Discrete and Computational Geometry年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0281177<br><br> <br><br>书目名称Discrete and Computational Geometry年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0281177<br><br> <br><br>书目名称Discrete and Computational Geometry读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0281177<br><br> <br><br>书目名称Discrete and Computational Geometry读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0281177<br><br> <br><br>
品牌
发表于 2025-3-21 22:40:51
http://reply.papertrans.cn/29/2812/281177/281177_2.png
油膏
发表于 2025-3-22 03:02:35
http://reply.papertrans.cn/29/2812/281177/281177_3.png
叫喊
发表于 2025-3-22 07:40:19
http://reply.papertrans.cn/29/2812/281177/281177_4.png
concentrate
发表于 2025-3-22 12:11:29
http://reply.papertrans.cn/29/2812/281177/281177_5.png
lethal
发表于 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.
lethal
发表于 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 .(...).
PLAYS
发表于 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.
Enteropathic
发表于 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.