Forbidden Configurations in Discrete Geometry

Synopsis

This book surveys the mathematical and computational properties of finite sets of points in the plane, covering recent breakthroughs on important problems in discrete geometry, and listing many open problems. It unifies these mathematical and computational views using forbidden configurations, which are patterns that cannot appear in sets with a given property, and explores the implications of this unified view.

Written with minimal prerequisites and featuring plenty of figures, this engaging book will be of interest to undergraduate students and researchers in mathematics and computer science. Most topics are introduced with a related puzzle or brain-teaser. The topics range from abstract issues of collinearity, convexity, and general position to more applied areas including robust statistical estimation and network visualization, with connections to related areas of mathematics including number theory, graph theory, and the theory of permutation patterns. Pseudocode is included for many algorithms that compute properties of point sets.

Proposes a unified view of problems in discrete geometry, helping readers understand the connections and commonalities between problems in the area.

Combines mathematical and computational views of the subject, and pseudocode for numerous algorithms, providing a readable introduction for computer science and mathematics students.

The book is accessible and motivating, featuring both recreational puzzles along with recent breakthroughs and open problems.

Copyright:

2018

Book Details

Book Quality:

Publisher Quality

ISBN-13:

9781108540278

Related ISBNs:

9781108423915, 9781108423915

Publisher:

Cambridge University Press

Date of Addition:

06/15/18

Copyrighted By:

David Eppstein

Adult content:

No

Language:

English

Has Image Descriptions:

No

Categories:

Nonfiction, Mathematics and Statistics

Submitted By:

Bookshare Staff

Usage Restrictions:

This is a copyrighted book.