Overmars M (23 results)

Hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Hardcover. Condition: Acceptable. Connecting readers with great books since 1972. Used textbooks may not include companion materials such as access codes, etc. May have condition issues including wear and notes/highlighting. We ship orders daily and Customer Service is our top priority.

Condition: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Includes disk Please note the Image in this listing is a stock photo and may not match the covers of the actual item,750grams, ISBN:9781590596159. …

Condition: New.

hardcover. Condition: Very Good. 2nd rev. ed. Unmarked pages. Solid binding.

Hard Cover. Condition: Very Good. Dust Jacket Condition: Not Issued with a Dust Jacket. The second edition, revised, 367 pages with 37 b&w illustrations. "This well-accepted introduction to computational geometry is a textbook for high-level undergraduate and low-level graduate courses. The focus is on algorithms and hence the book is well suited for students in computer science and engineering." VERY GOOD HARDCOVER, DEFECTS NOTED: Previous owner name present, and some pencil underlining on some pages up to page 101, else fine-. Else a nice clean tight copy. Not issued with a dust jacket. Size: 8vo - over 7¾" - 9¾" tall.…

Condition: New.

Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Paperback. Condition: New. Print on Demand. This book provides an efficient algorithm for the motion planning problem, determining whether an L-shaped object can move continuously between two positions without colliding with obstacles. The authors present a decomposition approach to motion planning, partitioning the free space of the object into connected cells. They introduce a new technique for compactly representing free space, resulting in a significant reduction in computation time. While previous general-purpose algorithms for motion planning required cubic time, this book's algorithm runs in subcubic time, making it suitable for planning the motion of complex objects amidst obstacles. This book is essential reading for researchers in motion planning and robotics, offering a substantial advancement in the 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. …

Condition: Used. pp. xii + 367 2nd Edition.

Condition: Used. pp. xii + 367 Illus.

Gebunden. Condition: New.

Condition: Used. pp. xii + 367.

Clich'e's. Hans Logjes & Miek Overmars. [118857].

Condition: New. Satisfaction Guaranteed or your money back.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New. Print on Demand pp. 26.

Condition: New. Print on Demand pp. 42.

Condition: gut. Computational Geometry In deutscher Sprache. pages.