Thin Edges
Download Thin Edges PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Thin Edges 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.
Discrete and Computational Geometry, 2nd Edition
Author: Satyan L. Devadoss
language: en
Publisher: Princeton University Press
Release Date: 2025-07-08
The essential introduction to discrete and computational geometry—now fully updated and expanded Discrete and Computational Geometry bridges the theoretical world of discrete geometry with the applications-driven realm of computational geometry, offering a comprehensive yet accessible introduction to this cutting-edge frontier of mathematics and computer science. Beginning with polygons and ending with polyhedra, it explains how to capture the shape of data given by a set of points, from convex hulls and triangulations to Voronoi diagrams, geometric duality, chains, linkages, and alpha complexes. Connections to real-world applications are made throughout, and algorithms are presented independent of any programming language. Now fully updated and expanded, this richly illustrated textbook is an invaluable learning tool for students in mathematics, computer science, engineering, and physics. Now with new sections on duality and on computational topology Project suggestions at the end of every chapter Covers traditional topics as well as new and advanced material Features numerous full-color illustrations, exercises, and fully updated unsolved problems Uniquely designed for a one-semester class Accessible to college sophomores with minimal background Also suitable for more advanced students Online solutions manual (available to instructors)
Perfect Matchings
Author: Cláudio L. Lucchesi
language: en
Publisher: Springer Nature
Release Date: 2024-03-25
Beginning with its origins in the pioneering work of W.T. Tutte in 1947, this monograph systematically traces through some of the impressive developments in matching theory. A graph is matchable if it has a perfect matching. A matching covered graph is a connected graph on at least two vertices in which each edge is covered by some perfect matching. The theory of matching covered graphs, though of relatively recent vintage, has an array of interesting results with elegant proofs, several surprising applications and challenging unsolved problems. The aim of this book is to present the material in a well-organized manner with plenty of examples and illustrations so as to make it accessible to undergraduates, and also to unify the existing theory and point out new avenues to explore so as to make it attractive to graduate students.
Automata, Languages and Programming
Author: Luca Aceto
language: en
Publisher: Springer Science & Business Media
Release Date: 2011-06-27
The two-volume set LNCS 6755 and LNCS 6756 constitutes the refereed proceedings of the 38th International Colloquium on Automata, Languages and Programming, ICALP 2011, held in Zürich, Switzerland, in July 2011. The 114 revised full papers (68 papers for track A, 29 for track B, and 17 for track C) presented together with 4 invited talks, 3 best student papers, and 3 best papers were carefully reviewed and selected from a total of 398 submissions. The papers are grouped in three major tracks on algorithms, complexity and games; on logic, semantics, automata, and theory of programming; as well as on foundations of networked computation: models, algorithms and information management.