Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
More buying choices from other sellers on AbeBooks
New offers from £ 12.99
Used offers from £ 102.24
Also find Softcover
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
More buying choices from other sellers on AbeBooks
New offers from £ 13.31
Used offers from £ 102.88
Also find Softcover
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
More buying choices from other sellers on AbeBooks
New offers from £ 13.31
Used offers from £ 103.30
Also find Softcover
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
Seller: Forgotten Books, London, United Kingdom
£ 13.12
Convert currencyQuantity: Over 20 available
Add to basketPaperback. 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: Forgotten Books, London, United Kingdom
£ 13.19
Convert currencyQuantity: Over 20 available
Add to basketPaperback. Condition: New. Print on Demand. This book explores the unexpected properties of Davenport-Schinzel sequences and generalized path compression schemes on trees. These intricate sequences possess unique characteristics that have fascinated mathematicians for decades, with applications in a wide range of fields, including computational geometry and dynamic computational problems. The author delves into the history of these sequences, their mathematical significance, and their practical implications. Through a rigorous analysis, the book reveals the surprising connections between these seemingly unrelated concepts, providing a deeper understanding of their underlying structures. Ultimately, this book offers valuable insights into the nature of these mathematical objects and their potential for future research and applications. 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: Forgotten Books, London, United Kingdom
£ 13.22
Convert currencyQuantity: Over 20 available
Add to basketPaperback. Condition: New. Print on Demand. This book delves into the intricacies of motion planning, a key aspect of robotics, where systems must move efficiently and safely within complex environments. The author explores various approaches to solving motion planning problems, including a novel algorithm that reduces computation time for calculating a single connected component of the free configuration space by almost a linear factor. The book also provides a comprehensive analysis of the combinatorial complexity of such components, paving the way for more efficient algorithms in the future. Through these insights, the book advances our understanding of motion planning and its applications in robotics, making it a valuable resource for researchers and practitioners alike. 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: Forgotten Books, London, United Kingdom
£ 13.29
Convert currencyQuantity: Over 20 available
Add to basketPaperback. Condition: New. Print on Demand. This book presents a construction for realizing nonlinear Davenport-Schinzel sequences by segments. The Davenport-Schinzel sequence, introduced by H. Davenport and A. Schinzel, is a sequence of symbols in which no two adjacent symbols are equal, and it contains no subsequence of the form . Davenport and Schinzel proved that for any natural number, there exists a Davenport-Schinzel sequence of length that uses symbols. In this book, the author constructs a set of segments in the plane whose lower envelope (the pointwise minimum of the segments when viewed as functions of x) consists of subsegments of the segments in the set. The author shows that for each and sufficiently large, there exists a Davenport-Schinzel sequence of length that can be realized by a set of segments. This result settles an open problem in the theory of Davenport-Schinzel sequences and provides a new tool for studying the combinatorial properties of these sequences. 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: Forgotten Books, London, United Kingdom
£ 13.37
Convert currencyQuantity: Over 20 available
Add to basketPaperback. Condition: New. Print on Demand. This book introduces a collection of problems related to the visibility of a polyhedral terrain or from a point or several points lying above it. It begins by discussing efficient techniques for three visibility problems involving polyhedral terrains and fixed viewing points. The book then considers visibility structures of polyhedral terrains when the viewing point can vary along a fixed vertical line. This leads to a discussion of the Davenport-Schinzel sequences, their properties, and their relevance to visibility problems. The book provides insights into computational geometry and is suitable for readers interested in understanding 3D visibility problems and their solutions. 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.