Minimum Traversal Path of n Circles
 |
|
Описание:
Circle is as the compromising solution to substitute versatile complex geometric object had been widely applied in the fields of robotics, computational geometry, and CAD/CAM. This book is devoted in developing efficient methods for constructing the minimum traversal path of n circles in 2D plane. With the algorithms provided in this book, when distributing n mutually exclusive circles in a 2D plane, the shortest path can be constructed very fast which traverses from a given starting point to all of the n circles and finished at the ending point such that the Euclidean distance of the path is a minimum. The algorithms are applicable for computer systems in real world applications. Professionals in the fields of computer science especially in computational geometry, circle packing, path planning, tool path planning in layered manufacturing, computer-aided design and manufacturing, optimization, or anyone who may be interested in light reflection (or refraction), geometry, and the...Похожие книги
 | Binomial Nomenclature Год: 2011 |
 | Fractal Music, Hypercards and More Mathematical Recreations from "Scientific American" Автор: Martin Gardner Год: 1991 |
 | Apollonian gasket Год: 2011 |
 | Learning Circles: Creating Conditions for Professional Development Автор: Michelle Collay, Diane Dunlap, Walter Enloe, George W.,Jr. Gagnon Год: 1996 |
 | Analyses of Evolutionary Algorithms Автор: Edda Happ Год: 2010 |
 | South Pacific Aviation Автор: Semisi Taumoepeau Год: 2010 |