000			02186nam a22003378i 4500
001			CR9781108539180
003			UkCbUP
005			20200124160338.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			170616s2018||||enk o ||1 0|eng|d
020			_a9781108539180 (ebook)
020			_z9781108423915 (hardback)
020			_z9781108439138 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP
050		4	_aQA640.7 _b.E66 2018
082	0	4	_a516/.11 _223
100	1		_aEppstein, David, _eauthor.
245	1	0	_aForbidden configurations in discrete geometry / _cDavid Eppstein.
264		1	_aCambridge : _bCambridge University Press, _c2018.
300			_a1 online resource (ix, 230 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
500			_aTitle from publisher's bibliographic system (viewed on 16 May 2018).
520			_aThis 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.
650		0	_aDiscrete geometry.
650		0	_aCombinatorial analysis.
776	0	8	_iPrint version: _z9781108423915
856	4	0	_uhttps://doi.org/10.1017/9781108539180
999			_c523273 _d523271