Track My Order
Help Centre
Likes
My Wish ListsLogin / Join
Booktopia
Australia's local bookstore
Get Free Shipping on orders over $79
Intersection and Decomposition Algorithms for Planar Arrangements - No Information Available

Intersection and Decomposition Algorithms for Planar Arrangements

By: No Information Available

Hardcover | 26 August 1991

At a Glance

Hardcover

RRP $227.95

$199.75

12%OFF

or 4 interest-free payments of $49.94 with

 or 

Ships in 5 to 7 business days

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.

You Can Find This Book In

Non-FictionMathematicsAlgebraGeometryAlgebraic GeometryCombinatorics & Graph TheoryProbability & Statistics

More in Combinatorics & Graph Theory

Imo Problems, Theorems, And Methods : Combinatorics - Guangyu Xu

Imo Problems, Theorems, And Methods

Combinatorics

Paperback

RRP $50.99

$23.75

53%
OFF
A First Look At Graph Theory - John Clark

A First Look At Graph Theory

Paperback

RRP $88.99

$80.75

This product is categorised by