Isbn: 9780521404464 - intersection and decomposition algorithms for planar arrangements hardback (17 resultados)

hardcover. Condición: 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.

Condición: 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.

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

Cloth. Condición: Very Good. Estado de la sobrecubierta: No d/j as Published. Type: Book N.B. Small plain label to front paste. Letter J stamped on title page. No dust jacket. Boards slightly sprung.

Condición: Used. pp. 294 Index.

Condición: Used. pp. 294 14:B&W 6 x 9 in or 229 x 152 mm Case Laminate on White w/Gloss Lam.

Condición: Used. pp. 294.

Hardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condición: New.

Condición: New. In.

Condición: New. This book, first published in 1991, presents a study of various problems related to arrangements of lines, segments, or curves in the plane. Num Pages: 294 pages, black & white illustrations. BIC Classification: PBV. Category: (P) Professional & Vocational. Dimension: 239 x 170 x 17. Weight in Grams: 556. . 1991. hardcover. . . . . …

Condición: New. This book, first published in 1991, presents a study of various problems related to arrangements of lines, segments, or curves in the plane. Num Pages: 294 pages, black & white illustrations. BIC Classification: PBV. Category: (P) Professional & Vocational. Dimension: 239 x 170 x 17. Weight in Grams: 556. . 1991. hardcover. . . . . Books ship from the US and Ireland. …

Hardcover. Condición: Brand New. 293 pages. 9.50x6.50x1.00 inches. In Stock.

Hardcover. Condición: new. Hardcover. This book presents a study of various problems related to arrangements of lines, segments, or curves in the plane. The first problem is a proof of almost tight bounds on the length of (n,s)-Davenport-Schinzel sequences, a technique for obtaining optimal bounds for numerous algorithmic problems. Then the intersection problem is treated. The final problem is improving the efficiency of partitioning algorithms, particularly those used to construct spanning trees with low stabbing numbers, a very versatile tool in solving geometric problems. A number of applications are also discussed. This book presents a study of various problems related to arrangements of lines, segments, or curves in the plane. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Several geometric problems can be formulated in terms of the arrangements of a collection of curves in a plane, making this one of the most widely studied topics in computational geometry. This book, first published in 1991, presents a study of problems rel.…

Hardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Buch. Condición: Neu. Intersection and Decomposition Algorithms for Planar Arrangements | Pankaj K. Agarwal (u. a.) | Buch | Gebunden | Englisch | 2013 | Cambridge University Press | EAN 9780521404464 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand. …