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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. N� de ref. del art�culo 9780521404464

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: Intersection and Decomposition Algorithms ...

Editorial: Cambridge University Press, Cambridge

A�o de publicaci�n: 1991

Encuadernaci�n: Hardcover

Condici�n: new

Acerca de

Sinopsis:

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 related to arrangements of lines or curves in the plane.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

The Nile Group Pty Ltd
42 Apex Drive, Truganina, VIC, 3029, Australia

Condiciones de venta:

We guarantee the condition of every book as it's described on the Abebooks web sites. If you're dissatisfied with your purchase (Incorrect Book/Not as Described/Damaged) or if the order hasn't arrived, you're eligible for a refund within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days.

Condiciones de env�o:

Please note that titles are dispatched from our UK and NZ warehouse. Delivery times specified in shipping terms. Orders ship within 2 business days. Delivery to your door then takes 8-15 days.

M�todos de pago
aceptados por la librer�a

A�adir una petici�n

Art�culos relacionados a Intersection and Decomposition Algorithms for Planar...

Intersection and Decomposition Algorithms for Planar Arrangements (Hardcover)

Pankaj K. Agarwal

Nuevos - Encuadernaci�n de tapa dura

Informaci�n empresarial del vendedor