000855763 000__ 02627cam\a2200325\i\4500
000855763 001__ 855763
000855763 005__ 20210515155905.0
000855763 008__ 171111t20182018enka\\\\\b\\\\001\0\eng\d
000855763 010__ $$a  2018285830
000855763 020__ $$a9781108439138$$q(paperback)
000855763 020__ $$a1108439136$$q(paperback)
000855763 020__ $$a9781108423915$$q(hardcover)
000855763 020__ $$a1108423914$$q(hardcover)
000855763 035__ $$a(OCoLC)on1011027861
000855763 035__ $$a855763
000855763 040__ $$aYDX$$beng$$erda$$cYDX$$dGZM$$dOCLCF$$dMNG$$dUKMGB$$dTOH
000855763 049__ $$aISEA
000855763 050_4 $$aQA640.7$$b.E67 2018
000855763 08204 $$a516/.11$$223
000855763 1001_ $$aEppstein, David,$$eauthor.
000855763 24510 $$aForbidden configurations in discrete geometry /$$cDavid Eppstein.
000855763 264_1 $$aCambridge, United Kingdom ;$$aNew York, NY :$$bCambridge University Press,$$c2018.
000855763 300__ $$aix, 230 pages :$$billustrations (some color) ;$$c23 cm
000855763 336__ $$atext$$btxt$$2rdacontent
000855763 337__ $$aunmediated$$bn$$2rdamedia
000855763 338__ $$avolume$$bnc$$2rdacarrier
000855763 504__ $$aIncludes bibliographical references (pages 211-221) and index.
000855763 5050_ $$a1. A Happy Ending -- 2. Overview -- 3. Configurations -- 4. Subconfigurations -- 5. Properties, Parameters, and Obstacles -- 6. Computing with Configurations -- 7. Complexity Theory -- 8. Collinearity -- 9. General Position -- 10. General-Position Partitions -- 11. Convexity -- 12. More on Convexity -- 13. Integer Realizations -- 14. The Stretched Geometry of Permutations -- 15.  Configurations from Graphs --16. Universality -- 17. Stabbing -- 18. The Big Picture.
000855763 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.--Provided by publisher.
000855763 650_0 $$aDiscrete geometry.
000855763 85200 $$bgen$$hQA640.7$$i.E67$$i2018
000855763 909CO $$ooai:library.usi.edu:855763$$pGLOBAL_SET
000855763 980__ $$aBIB
000855763 980__ $$aBOOK