Skip to content

Your Cart


You have 0 items in your cart.

Register Sign in Wishlist

Forbidden Configurations in Discrete Geometry


  • Date Published: June 2018
  • availability: In stock
  • format: Paperback
  • isbn: 9781108439138

£ 29.99

Add to cart Add to wishlist

Other available formats:
Hardback, eBook

Looking for an inspection copy?

This title is not currently available on inspection

Product filter button
About the Authors
  • 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
    Read more

    Reviews & endorsements

    'David Eppstein has managed to unify a huge swath of research on planar point sets through monotone properties and forbidden configurations. For example, finding grid points that avoid the obstacle of a 3-point line is a century-old problem still not entirely resolved. The author's unification naturally uncovers research lacuna, several of which he fills, while others are formulated as sharp new open problems. This rare synthesis of previous work will reinvigorate and redirect the field.' Joseph O'Rourke, Smith College, Massachusetts

    'David Eppstein takes us on an adventure tour to the study of point configurations in Discrete Geometry. It visits many different topics, connected by the original viewpoint of 'forbidden configurations'. This is interesting, instructive - and fun!' Günter M. Ziegler, Freie Universität Berlin

    'This unique volume collects and unifies almost a century of work on point configurations on the plane, and their properties that depend on whether each subset of three points is oriented clockwise, oriented counterclockwise, or collinear. Beginning with the Happy Ending Theorem, the author takes us through entertaining problems and into computational geometry. A delight to read as well as a persuasive case for the method of forbidden configurations, the book will be a valuable addition to the library of any discrete or computational geometer.' Peter Winkler, Dartmouth College, New Hampshire

    'This is a fun read on certain topics in discrete and computational geometry. It begins with 'A Happy Ending' and ends with 'Only the Beginning'. Eppstein's journey through various problems of pointset configurations offers a new view of the subject even to experts of the field. Recommended to everyone who likes geometry and computer science.' Jozsef Solymosi, University of British Columbia

    'David Eppstein has brought the weight of his formidable expertise and expositional talents on the simplest of shapes: points and lines. He gently guides the reader through a vast array of fascinating topics, their greatest hits to the state-of-the-art. This lovely book will be found on the shelves of mathematicians and computer scientists for many years to come.' Satyan Devadoss, University of San Diego

    'Erdős's many beautiful, notoriously difficult geometric problems on finite point configurations led to the birth of a new discipline: combinatorial geometry. The field gained additional significance in the 1980s, when it was discovered to be relevant to basic questions in computational geometry. Eppstein's elegantly written and illustrated book takes a fresh algorithmic look at the theory of forbidden geometric patterns. It can be read by specialists as a survey, but it can also serve as an excellent textbook for an introductory course on point configurations.' János Pach, École Polytechnique Fédérale de Lausanne and Rényi Institute, Budapest

    'There is a lot to like about this book, as Eppstein does a good job of introducing the material to his readers … A reader who sticks with Eppstein will learn a lot about this exciting area that lies on the border of mathematics and computer science.' Darren Glass, MAA Reviews

    'The result is a first-class treatment: Eppstein deftly sells the subject to the uninitiated, yet carries it to depths experts will appreciate. A generous supply of diagrams gracefully projects many ideas, and the professional-quality design makes the reading experience a pleasure. Summing Up: Highly recommended.' D. V. Feldman, Choice

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: June 2018
    • format: Paperback
    • isbn: 9781108439138
    • length: 238 pages
    • dimensions: 228 x 152 x 10 mm
    • weight: 0.46kg
    • availability: In stock
  • Table of Contents

    1. 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. Stretched permutations
    15. Configurations from graphs
    16. Universality
    17. Stabbing
    18. The big picture.

  • Resources for

    Forbidden Configurations in Discrete Geometry

    David Eppstein

    General Resources

    Welcome to the resources site

    Here you will find free-of-charge online materials to accompany this book. The range of materials we provide across our academic and higher education titles are an integral part of the book package whether you are a student, instructor, researcher or professional.

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    *This title has one or more locked files and access is given only to lecturers adopting the textbook for their class. We need to enforce this strictly so that solutions are not made available to students. To gain access to locked resources you either need first to sign in or register for an account.

    These resources are provided free of charge by Cambridge University Press with permission of the author of the corresponding work, but are subject to copyright. You are permitted to view, print and download these resources for your own personal use only, provided any copyright lines on the resources are not removed or altered in any way. Any other use, including but not limited to distribution of the resources in modified form, or via electronic or other media, is strictly prohibited unless you have permission from the author of the corresponding work and provided you give appropriate acknowledgement of the source.

    If you are having problems accessing these resources please email

  • Author

    David Eppstein, University of California, Irvine
    David Eppstein is Chancellor's Professor of Computer Science at the University of California, Irvine. He has over 350 publications on subjects including discrete and computational geometry, graph theory, graph algorithms, data structures, robust statistics, social network analysis and visualization, mesh generation, biosequence comparison, exponential algorithms, and recreational mathematics. He has been the moderator for data structures and algorithms on since 2006, and is a major contributor to Wikipedia's articles on mathematics and theoretical computer science. He was elected as an ACM fellow in 2012.

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.