Leonidas guibas (69 risultati)

Hardcover. Condizione: Very Good. 1. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Hardcover. Condizione: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

Condizione: New.

Paperback or Softback. Condizione: New. Ray Shooting, Implicit Point Location, and Related Queries in Arrangements of Segments. Book.

Condizione: New.

Condizione: New.

Condizione: New.

Condizione: New.

Condizione: New.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Condizione: New.

Condizione: New.

HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Condizione: New.

Paperback or Softback. Condizione: New. Advances in Plan-Based Control of Robotic Agents: International Seminar, Dagstuhl Castle, Germany, October 21-26, 2001, Revised Papers. Book.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Paperback. Condizione: New. Print on Demand. This book delves into the realm of topological and combinatorial properties of the boundary of a union of regions in a plane, bounded by Jordan curves. The author investigates these properties, under the assumption that any two curves intersect in at most three points, a condition known as the three-intersection problem. By constructing a simply connected surface that covers the union of these regions, the author proves that the total number of intersection points on the boundary is bounded by a specific function of the number of regions. This bound holds even in cases where the complement of the union contains holes. The book's insights provide valuable contributions to the understanding of the geometric properties of such boundaries and have implications for motion-planning algorithms and other combinatorial optimization problems. 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.…

Paperback. Condizione: New. Print on Demand. This book presents a study of arrangements of curves in the plane. These arrangements are fundamental to many problems in computational and combinatorial geometry, such as motion planning, algebraic cell decomposition, and geometric optimization. The author develops basic tools for the construction, manipulation, and analysis of these arrangements, and provides a generalization of the zone theorem of Chazelle, Edelsbrunner, and Guibas. This theorem states that the combinatorial complexity of the zone of a curve is nearly linear in the number of curves, and the author shows that this result can be applied to obtain a nearly quadratic incremental algorithm for the construction of such arrangements. The book also includes a discussion of the topological and combinatorial properties of these arrangements, and provides new insights into the combinatorial complexity of a single component in an arrangement of triangles in three-dimensional space. The work presented in this book has important implications for a wide range of problems in computational geometry, and provides a valuable resource for researchers and practitioners in this field. 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.…

Paperback. Condizione: New. Print on Demand. This book explores the intricate relationships between points and planes, particularly in three-dimensional space and to a lesser extent in higher dimensions. The text begins by defining what is meant by an arrangement of planes and then goes on to consider the complexity of such arrangements, or, in other words, how complicated they can be. The author establishes both upper and lower bounds on this complexity, providing a precise understanding of the possible configurations of points and planes. The book also investigates the problem of counting the number of incidences between points and planes, with the author obtaining sharp bounds on the maximum number of such incidences. These results have important implications for various fields, including computational geometry, which deals with problems related to the representation and manipulation of geometric objects. 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.…

Paperback. Condizione: New. Print on Demand. This book explores the development of advanced techniques for various types of queries on arrangements of segments and related structures. Ray shooting, implicit point location, and related problems form the core of this research. The author presents efficient techniques for answering various queries on planar arrangements of segments and certain related structures. These techniques extend and modify recent efficient techniques for half-plane range searching to obtain algorithms for answering efficiently several types of queries on arrangements of segments and certain related structures. A typical example is the implicit point location problem â" given such an arrangement A, preprocess it so that, given any query point x, we can calculate quickly certain properties of the face of A containing x. The results of this book have been conceived and developed in the summer of 1987, but for various reasons were left unpublished for almost two years. Meanwhile, there has been significant progress on the problems studied here. In particular, a recent work by Agarwal presents techniques that achieve query time roughly O(sqrt(n)) and involve deterministic, rather than randomized, preprocessing. Agarwal's results are based on a decomposition technique that is different from the one used in this book. Still, many of Agarwal's arguments are taken from this book. As a public service, to make our results somewhat more accessible, the author has decided to elevate this book from the status of unpublished manuscript to that of a technical report. 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.…

Paperback. Condizione: New. Print on Demand. This book presents innovative techniques that make it possible to represent arrangements of lines or segments in a compact and efficient manner. Arrangements arise in diverse domains such as computational geometry, computer graphics, and geographic information systems but their analysis is often hindered by high computational complexity. The author presents a range of novel algorithms designed to overcome this challenge. The core contribution is a method for constructing an implicit representation of the arrangement in subquadratic time and space. This representation can then be used to solve a variety of problems efficiently, including point location, ray shooting, and counting the number of line intersections in a given region. The book provides comprehensive theoretical analyses of the algorithms and thorough experimental evaluations demonstrating their practical utility. Researchers and practitioners alike will find this book to be an invaluable resource for understanding and working with arrangements of lines and segments. 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.…

Paperback. Condizione: New. Print on Demand. This book offers a highly analytical exploration of line arrangements in the plane, an important topic in computational geometry. The author delves into determining the maximum number of edges that bound a collection of faces within a given arrangement of lines or line segments. This investigation sheds light on the inherent combinatorial complexity of such arrangements, a subject that has captivated mathematicians for centuries. Through rigorous analysis and intricate algorithms, the author uncovers captivating insights into the intricate relationships between lines and their intersections, providing a deeper understanding of the fundamental structures that govern geometric configurations. 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.…

Paperback. Condizione: 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.…

Taschenbuch. Condizione: Neu. Neuware - This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work.…

Paperback. Condizione: New. 2002 ed. In recent years, autonomous robots, including Xavier, Martha [1], Rhino [2,3], Minerva,and Remote Agent, have shown impressive performance in long-term demonstrations. In NASA's Deep Space program, for example, an - tonomous spacecraft controller, called the Remote Agent [5], has autonomously performed a scienti?c experiment in space. At Carnegie Mellon University, Xavier [6], another autonomous mobile robot, navigated through an o?ce - vironment for more than a year, allowing people to issue navigation commands and monitor their execution via the Internet. In 1998, Minerva [7] acted for 13 days as a museum tourguide in the Smithsonian Museum, and led several thousand people through an exhibition. These autonomous robots have in common that they rely on plan-based c- trol in order to achieve better problem-solving competence. In the plan-based approach, robots generate control actions by maintaining and executing a plan that is e?ective and has a high expected utility with respect to the robots' c- rent goals and beliefs. Plans are robot control programs that a robot can not only execute but also reason about and manipulate [4]. Thus, a plan-based c- troller is able to manage and adapt the robot's intended course of action - the plan - while executing it and can thereby better achieve complex and changing tasks.…