Guibas (73 results)

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

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

Paperback or Softback. Condition: New. Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. Book.

Condition: New.

Condition: New.

Condition: New.

Condition: New.

Condition: New.

Condition: New.

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

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

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

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

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

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

Condition: New.

Condition: New.

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

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

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

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

Condition: New.

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

Taschenbuch. Condition: 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.…

tapa dura. Condition: 2ª Mano. 2ª Mano. Editorial Labor, S.A. 1990. Historia Universal, 7. Libro.

Condition: New.

Condition: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Condition: As New. Unread book in perfect condition.

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