@article{855763,
      recid = {855763},
      author = {Eppstein, David,},
      title = {Forbidden configurations in discrete geometry /},
      pages = {ix, 230 pages :},
      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.},
      url = {http://library.usi.edu/record/855763},
}