Forbidden Configurations In Discrete Geometry
Download Forbidden Configurations In Discrete Geometry PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Forbidden Configurations In Discrete Geometry book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Forbidden Configurations in Discrete Geometry
Author: David Eppstein
language: en
Publisher: Cambridge University Press
Release Date: 2018-05-17
Unifies discrete and computational geometry by using forbidden patterns of points to characterize many of its problems.
Discrete Geometry
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.
Algorithms and Complexity
The two-volume set LNCS 15679 and 15680 constitutes the refereed proceedings of the 14th International Conference on Algorithms and Complexity, CIAC 2025, held in Rome, Italy, during June 10–12, 2025. The 44 full papers included in these proceedings were carefully reviewed and selected from 110 submissions. They focus on all aspects of important venue for researchers working on computational complexity and the design, analysis, experimentation, and application of efficient algorithms and data structures.