|
" Forbidden configurations in discrete geometry / "
David Eppstein.
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
839437
|
| Main Entry
|
:
|
Eppstein, David
|
| Title & Author
|
:
|
Forbidden configurations in discrete geometry /\ David Eppstein.
|
| Publication Statement
|
:
|
Cambridge, United Kingdom ;New York, NY :: Cambridge University Press,, 2018.
|
|
|
:
|
, ©2018
|
| Page. NO
|
:
|
ix, 230 pages :: illustrations (some color) ;; 24 cm
|
| ISBN
|
:
|
1108423914
|
|
|
:
|
: 1108439136
|
|
|
:
|
: 9781108423915
|
|
|
:
|
: 9781108439138
|
|
|
:
|
9781108542975
|
| Bibliographies/Indexes
|
:
|
Includes bibliographical references (pages 211-221) and index.
|
| Contents
|
:
|
A happy ending -- Overview -- Configurations -- Subconfigurations -- Properties, parameters, and obstacles -- Computing with configurations -- Complexity theory -- Collinearity -- General position -- General-position partitions -- Convexity -- More on convexity -- Integer realizations -- The stretched geometry of permutations -- Configurations from graphs --Universality -- Stabbing -- The big picture.
|
| Abstract
|
:
|
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. -- Provided by publisher.
|
| Subject
|
:
|
Discrete geometry.
|
| Subject
|
:
|
Discrete geometry.
|
| Subject
|
:
|
MATHEMATICS-- Geometry-- General.
|
| Dewey Classification
|
:
|
516/.11
|
| LC Classification
|
:
|
QA640.7.E67 2018
|
| |