Forbidden Configurations in Discrete Geometry
Forbidden Configurations in Discrete Geometry

Author: David Eppstein

Publisher: Cambridge University Press

Published: 2018-05-17

Total Pages: 242

ISBN-13: 1108542972

DOWNLOAD EBOOK

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.

Forbidden Configurations in Discrete Geometry
Forbidden Configurations in Discrete Geometry

Author: David Eppstein

Publisher: Cambridge University Press

Published: 2018-05-17

Total Pages: 241

ISBN-13: 1108423914

DOWNLOAD EBOOK

Unifies discrete and computational geometry by using forbidden patterns of points to characterize many of its problems.

Forbidden Configurations in Discrete Geometry
Forbidden Configurations in Discrete Geometry

Author: David Eppstein

Publisher: Cambridge University Press

Published: 2018-05-17

Total Pages: 241

ISBN-13: 1108540279

DOWNLOAD EBOOK

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.

Discrete Geometry
Discrete Geometry

Author: Andras Bezdek

Publisher: CRC Press

Published: 2003-02-04

Total Pages: 500

ISBN-13: 0824747615

DOWNLOAD EBOOK

Celebrating the work of Professor W. Kuperberg, this reference explores packing and covering theory, tilings, combinatorial and computational geometry, and convexity, featuring an extensive collection of problems compiled at the Discrete Geometry Special Session of the American Mathematical Society in New Orleans, Louisiana. Discrete Geometry analyzes packings and coverings with congruent convex bodies , arrangements on the sphere, line transversals, Euclidean and spherical tilings, geometric graphs, polygons and polyhedra, and fixing systems for convex figures. This text also offers research and contributions from more than 50 esteemed international authorities, making it a valuable addition to any mathematical library.

Research Problems in Discrete Geometry
Research Problems in Discrete Geometry

Author: Peter Brass

Publisher: Springer Science & Business Media

Published: 2006-01-27

Total Pages: 507

ISBN-13: 0387299297

DOWNLOAD EBOOK

This book is the result of a 25-year-old project and comprises a collection of more than 500 attractive open problems in the field. The largely self-contained chapters provide a broad overview of discrete geometry, along with historical details and the most important partial results related to these problems. This book is intended as a source book for both professional mathematicians and graduate students who love beautiful mathematical questions, are willing to spend sleepless nights thinking about them, and who would like to get involved in mathematical research.

Handbook of Discrete and Computational Geometry
Handbook of Discrete and Computational Geometry

Author: Csaba D. Toth

Publisher: CRC Press

Published: 2017-11-22

Total Pages: 2354

ISBN-13: 1351645919

DOWNLOAD EBOOK

The Handbook of Discrete and Computational Geometry is intended as a reference book fully accessible to nonspecialists as well as specialists, covering all major aspects of both fields. The book offers the most important results and methods in discrete and computational geometry to those who use them in their work, both in the academic world—as researchers in mathematics and computer science—and in the professional world—as practitioners in fields as diverse as operations research, molecular biology, and robotics. Discrete geometry has contributed significantly to the growth of discrete mathematics in recent years. This has been fueled partly by the advent of powerful computers and by the recent explosion of activity in the relatively young field of computational geometry. This synthesis between discrete and computational geometry lies at the heart of this Handbook. A growing list of application fields includes combinatorial optimization, computer-aided design, computer graphics, crystallography, data analysis, error-correcting codes, geographic information systems, motion planning, operations research, pattern recognition, robotics, solid modeling, and tomography.

Discrete Geometry for Computer Imagery
Discrete Geometry for Computer Imagery

Author: Achille Braquelaire

Publisher: Springer Science & Business Media

Published: 2002-03-20

Total Pages: 450

ISBN-13: 3540433805

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 10th International Conference on Digital Geometry for Computer Imagery, DGCI 2002, held in Bordeaux, France, in April 2002. The 22 revised full papers and 13 posters presented together with 3 invited papers were carefully reviewed and selected from 67 submissions. The papers are organized in topical sections on topology, combinatorial image analysis, morphological analysis, shape representation, models for discrete geometry, segmentation and shape recognition, and applications.

Graph Drawing and Network Visualization
Graph Drawing and Network Visualization

Author: Daniel Archambault

Publisher: Springer Nature

Published: 2019-11-28

Total Pages: 624

ISBN-13: 303035802X

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 27th International Symposium on Graph Drawing and Network Visualization, GD 2019, held in Prague, Czech Republic, in September 2019. The 42 papers and 12 posters presented in this volume were carefully reviewed and selected from 113 submissions. They were organized into the following topical sections: Cartograms and Intersection Graphs, Geometric Graph Theory, Clustering, Quality Metrics, Arrangements, A Low Number of Crossings, Best Paper in Track 1, Morphing and Planarity, Parameterized Complexity, Collinearities, Topological Graph Theory, Best Paper in Track 2, Level Planarity, Graph Drawing Contest Report, and Poster Abstracts.

Computing and Combinatorics
Computing and Combinatorics

Author: Chi-Yeh Chen

Publisher: Springer Nature

Published: 2021-10-21

Total Pages: 699

ISBN-13: 3030895432

DOWNLOAD EBOOK

This book constitutes the proceedings of the 27th International Conference on Computing and Combinatorics, COCOON 2021, held in Tainan, Taiwan, in October 2021. Due to the COVID-19 pandemic, COCOON 2021 was organized as a hybrid conference. The 56 papers presented in this volume were carefully reviewed and selected from 131 submissions. The papers are divided into the following topical sub-headings: algorithms, approximation algorithms, automata, computational geometry, fault tolerant computing and fault diagnosis, graph algorithms, graph theory and applications, network and algorithms, online algorithm and stream algorithms, parameterized complexity and algorithms, and recreational games.

Lectures on Discrete Geometry
Lectures on Discrete Geometry

Author: Jiri Matousek

Publisher: Springer Science & Business Media

Published: 2013-12-01

Total Pages: 491

ISBN-13: 1461300398

DOWNLOAD EBOOK

The main topics in this introductory text to discrete geometry include basics on convex sets, convex polytopes and hyperplane arrangements, combinatorial complexity of geometric configurations, intersection patterns and transversals of convex sets, geometric Ramsey-type results, and embeddings of finite metric spaces into normed spaces. In each area, the text explains several key results and methods.