使醉 发表于 2025-3-21 18:35:25

书目名称Discrete and Computational Geometry and Graphs影响因子(影响力)<br>        http://impactfactor.cn/2024/if/?ISSN=BK0281181<br><br>        <br><br>书目名称Discrete and Computational Geometry and Graphs影响因子(影响力)学科排名<br>        http://impactfactor.cn/2024/ifr/?ISSN=BK0281181<br><br>        <br><br>书目名称Discrete and Computational Geometry and Graphs网络公开度<br>        http://impactfactor.cn/2024/at/?ISSN=BK0281181<br><br>        <br><br>书目名称Discrete and Computational Geometry and Graphs网络公开度学科排名<br>        http://impactfactor.cn/2024/atr/?ISSN=BK0281181<br><br>        <br><br>书目名称Discrete and Computational Geometry and Graphs被引频次<br>        http://impactfactor.cn/2024/tc/?ISSN=BK0281181<br><br>        <br><br>书目名称Discrete and Computational Geometry and Graphs被引频次学科排名<br>        http://impactfactor.cn/2024/tcr/?ISSN=BK0281181<br><br>        <br><br>书目名称Discrete and Computational Geometry and Graphs年度引用<br>        http://impactfactor.cn/2024/ii/?ISSN=BK0281181<br><br>        <br><br>书目名称Discrete and Computational Geometry and Graphs年度引用学科排名<br>        http://impactfactor.cn/2024/iir/?ISSN=BK0281181<br><br>        <br><br>书目名称Discrete and Computational Geometry and Graphs读者反馈<br>        http://impactfactor.cn/2024/5y/?ISSN=BK0281181<br><br>        <br><br>书目名称Discrete and Computational Geometry and Graphs读者反馈学科排名<br>        http://impactfactor.cn/2024/5yr/?ISSN=BK0281181<br><br>        <br><br>

hieroglyphic 发表于 2025-3-21 23:29:45

http://reply.papertrans.cn/29/2812/281181/281181_2.png

echnic 发表于 2025-3-22 03:27:10

http://reply.papertrans.cn/29/2812/281181/281181_3.png

ADORE 发表于 2025-3-22 06:31:41

http://reply.papertrans.cn/29/2812/281181/281181_4.png

Vulvodynia 发表于 2025-3-22 12:19:58

http://reply.papertrans.cn/29/2812/281181/281181_5.png

Flounder 发表于 2025-3-22 14:29:21

http://reply.papertrans.cn/29/2812/281181/281181_6.png

Flounder 发表于 2025-3-22 20:48:40

http://reply.papertrans.cn/29/2812/281181/281181_7.png

含糊其辞 发表于 2025-3-22 22:56:44

Minimum Rectilinear Polygons for Given Angle Sequences,right turns. The number of left turns always equals the number of right turns plus 4. It is known that any such sequence can be realized by a rectilinear polygon. In this paper, we consider the problem of finding realizations that minimize the perimeter or the area of the polygon or the area of the

兵团 发表于 2025-3-23 02:36:57

http://reply.papertrans.cn/29/2812/281181/281181_9.png

行为 发表于 2025-3-23 09:25:57

http://reply.papertrans.cn/29/2812/281181/281181_10.png
页: [1] 2 3 4 5 6 7
查看完整版本: Titlebook: Discrete and Computational Geometry and Graphs; 18th Japan Conferenc Jin Akiyama,Hiro Ito,Yushi Uno Conference proceedings 2016 Springer In