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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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 arXiv.org 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.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 0,84 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoLibrería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: FM-9781108439138
Cantidad disponible: 6 disponibles
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
Condición: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Nº de ref. del artículo: ABNR-21946
Cantidad disponible: 5 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: FM-9781108439138
Cantidad disponible: 6 disponibles
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Paperback / softback. Condición: New. New copy - Usually dispatched within 4 working days. 497. Nº de ref. del artículo: B9781108439138
Cantidad disponible: Más de 20 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 230 pages. 9.00x6.00x0.50 inches. In Stock. Nº de ref. del artículo: __1108439136
Cantidad disponible: 1 disponibles
Librería: CitiRetail, Stevenage, Reino Unido
Paperback. Condición: new. Paperback. 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. This engaging book unifies mathematical and computational properties of finite sets of points in the plane using forbidden configurations, which are patterns that cannot appear in sets with a given property, and helps students and researchers explore the implications of this unified view of discrete geometry. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Nº de ref. del artículo: 9781108439138
Cantidad disponible: 1 disponibles
Librería: AussieBookSeller, Truganina, VIC, Australia
Paperback. Condición: new. Paperback. 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. This engaging book unifies mathematical and computational properties of finite sets of points in the plane using forbidden configurations, which are patterns that cannot appear in sets with a given property, and helps students and researchers explore the implications of this unified view of discrete geometry. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Nº de ref. del artículo: 9781108439138
Cantidad disponible: 1 disponibles
Librería: Grand Eagle Retail, Mason, OH, Estados Unidos de America
Paperback. Condición: new. Paperback. 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. This engaging book unifies mathematical and computational properties of finite sets of points in the plane using forbidden configurations, which are patterns that cannot appear in sets with a given property, and helps students and researchers explore the implications of this unified view of discrete geometry. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9781108439138
Cantidad disponible: 1 disponibles