PERHAPS A GIFT VOUCHER FOR MUM?: MOTHER'S DAY

Close Notification

Your cart does not contain any items

Intersection and Decomposition Algorithms for Planar Arrangements

Pankaj K. Agarwal (Duke University, North Carolina)

$193.95

Hardback

Not in-store but you can order this
How long will it take?

QTY:

English
Cambridge University Press
26 August 1991
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.

By:  
Imprint:   Cambridge University Press
Country of Publication:   United Kingdom
Dimensions:   Height: 238mm,  Width: 156mm,  Spine: 19mm
Weight:   556g
ISBN:   9780521404464
ISBN 10:   0521404460
Pages:   294
Publication Date:  
Audience:   Professional and scholarly ,  Undergraduate
Format:   Hardback
Publisher's Status:   Active

See Also