ISBN: 9780521404464 - intersection and decomposition algorithms for planar arrangements (7 Ergebnisse)

Zustand: 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.

Cloth. Zustand: Very Good. Zustand des Schutzumschlags: 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.

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

Zustand: Used. pp. 294.

Zustand: 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. Zustand: Brand New. 293 pages. 9.50x6.50x1.00 inches. In Stock.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Several geometric problems can be formulated in terms of the arrangement of a collection of curves in a plane, which has made this one of the most widely studied topics in computational geometry. This book, first published in 1991, 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. Researchers in computational and combinatorial geometry should find much to interest them in this book.…