Designing algorithms with multi-sphere scheme

Proceedings - International Conference on Informatics Education and Research for Knowledge-Circulating Society, ICKS 2008

Volumn , Issue , 2008, Pages 125-130

  Imamichi, Takashi ^a   Nagamochi, Hiroshi ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX POLYTOPES; CURVED SURFACES; INFORMATICS EDUCATION; INTERNATIONAL CONFERENCES; PACKING PROBLEMS;

TOPOLOGY;

EID: 50149088792     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICKS.2008.22     Document Type: Conference Paper

References (16)

1. P. Agarwal, L. Guibas, A. Nguyen. D. Russel, and L. Zhang. Collision detection for deforming necklaces. Computational Geometry. 28(2-3): 137-163. 2004.
2. P. K. Agarwal, L. J. Guibas. S. Har-Peled, A. Rabinovitch, and M. Sharir. Penetration depth of two convex polytopes in 3D. Nordic Journal of Computing. 7(3):227-240, 2000.
3. J. A. Bennell, K. A. Dowsland, and W. B. Dowsland. The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon. Computers & Operations Research, 28(3):271-287, 2001.
4. E. G. Birgin, J. M. Martinez, and D. P. Ronconi. Optimizing the packing of cylinders into a rectangular container: A nonlinear approach. European Journal of Operational Research. 160(0:19-33, 2005.
5. V. Choi and N. Goyal. A combinatorial shape matching algorithm for rigid protein docking. In CPM2004: Proceedings of the Fifteenth Annual Combinatorial Pattern Matching Symposium 2004, volume 3109 of Lecture Notes in Computer Science, pages 285-296. Springer, 2004.
6. J.-A. Ferrez. Dynamic triangulations for efficient 3D simulation of granular materials. PhD thesis, École Polytechnique Fédérale de Lausanne, 2001.
7. M. A. Gomes and J. F. Oliveira. Solving irregular strip packing problems by hybridising simulated annealing and linear programming. European Journal of Operational Research, 171(3):811-829, 2006.
8. I. Halperin, B. Ma, H. Wolfson, and R. Nussinov. Principles of docking: An overview of search algorithms and a guide to scoring functions. Proteins, 47(4):409-443, 2002.
9. P. M. Hubbard. Approximating polyhedra with spheres for time-critical collision detection. ACM Transactions on Graphics, 15(3): 179-210, 1996.
10. T. Imamichi, Y. Arahori, J. Gim, S.-H. Hong, and H. Nagamochi. Removing overlaps in label layouts using multisphere scheme, in preparation.
11. T. Imamichi and H. Nagamochi. A multi-sphere scheme for 2D and 3D packing problems. In SLS2007: Proceedings of Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics, volume 4638 of Lecture Notes in Computer Science, pages 207-211. Springer, 2007.
12. T. Imamichi, M. Yagiura, and H. Nagamochi. An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. Technical Report 2007-009, Department of Applied Mathematics and Physics, Graduate School of Informatics. Kyoto University, 2007.
13. D. C. Liu and J. Nocedal. On the limited memory BFGS method for large scale optimization. Mathematical Programming, 45(3):503-528, 1989. [14] V. J. Milenkovic. Rotational polygon overlap minimization and compaction. Computational Geometry. Theory and Applications, 10(4):305-318, 1998.
14. J. Mintseris, K. Wiehe, B. Pierce, R. Anderson, R. Chen. J. Janin, and Z. Weng. Protein-protein docking benchmark 2.0: an update. Proteins, 60(2):214-216, 2005.
15. N. J. A. Sloane. The sphere packing problem. Documenta Mathematica. ICM III:387-396, 1998.
16. H. Wang, W. Huang, Q. Zhang, and D. Xu. An improved algorithm for the packing of unequal circles within a larger containing circle. European Journal of Operational Research, 141(2):440-453, 2002.