Computational Geometry is becoming a pervasive technique which emerged from the field of algorithms design and analysis. Cutting a geometric shape out of another geometric shape with minimum cutting cost is a well-studied problem in computational geometry. Similarly finding the center of a sphere or an ellipsoid under binary detection constraints is subject of research for many years. In this book these two interesting problems are addressed and a number of algorithms have been presented. These algorithms are totally new and a number of sophisticated techniques are used here which can play an important role in industry. A number of open problems have also been proposed here which can lead towards some interesting research works. A number of international publications have come out while the authors of this book were doing research on these topics.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.