A fast algorithm for approximating the detour of a polygonal chain
- 作者Annette Ebbers-Baumann; Rolf Klein; Elmar Langetepe; Andrzej Lingas
- 卷第27卷
- 期第2期
- 印刷ISSN0925-7721
- 文件大小207.41KB
- 发表时间2004
- DOI10.1016/s0925-7721(03)00046-4
- 页码123-134
A polynomial time circle packing algorithmBojan Mohar · 1993
A linearized circle packing algorithmOrick, Gerald L.; Stephenson, Kenneth; Collins, Charles · Computational Geometry · 2017
An improved algorithm for the packing of unequal circles within a larger containing circleHuaiqing Wang; Wenqi Huang; Quan Zhang; Dongming Xu · 2002
An effective hybrid algorithm for the problem of packing circles into a larger containing circleDe-fu Zhang; An-sheng Deng · 2005
Note on: An improved algorithm for the packing of unequal circles within a larger containing circleWenqi Huang; Mao Chen · 2006
A bounded space algorithm for online circle packingHokama, Pedro; Miyazawa, Flávio K.; Schouery, Rafael C.S. · Information Processing Letters · 2016
An improved energy landscape paving algorithm for the problem of packing circles into a larger containing circleJingfa Liu; Shengjun Xue; Zhaoxia Liu; Danhua Xu · 2009