This book presents an algorithm for generalized point location and discusses its applications to several optimization problems. The generalized point location problem involves finding the location of a point among a collection of real algebraic varieties of constant maximum degree in logarithmic time. The author shows that Collins' classical quantifier elimination procedure contains most of the ingredients for an efficient point location algorithm in higher -dimensional space. This leads to a polynomial -size data structure which allows one to locate a point among a collection of real algebraic varieties of constant maximum degree in logarithmic time. This result has theoretical hearings on a number of optimization problems posed in the literature. It also gives a method for solving multidimensional searching problem in polynomial space and logarithmic query time. The author has acknowledged the support of the National Science Foundation and the Office of Naval Research and has expressed their gratitude towards various other organizations and individuals. Overall, this book is a valuable resource for researchers and students working in the field of computational geometry and optimization.
"synopsis" may belong to another edition of this title.
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: New. Print on Demand. This book presents an algorithm for generalized point location and discusses its applications to several optimization problems. The generalized point location problem involves finding the location of a point among a collection of real algebraic varieties of constant maximum degree in logarithmic time. The author shows that Collins' classical quantifier elimination procedure contains most of the ingredients for an efficient point location algorithm in higher -dimensional space. This leads to a polynomial -size data structure which allows one to locate a point among a collection of real algebraic varieties of constant maximum degree in logarithmic time. This result has theoretical hearings on a number of optimization problems posed in the literature. It also gives a method for solving multidimensional searching problem in polynomial space and logarithmic query time. The author has acknowledged the support of the National Science Foundation and the Office of Naval Research and has expressed their gratitude towards various other organizations and individuals. Overall, this book is a valuable resource for researchers and students working in the field of computational geometry and optimization. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781332086849_0
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332086849
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332086849
Quantity: 15 available