Geometry of Cuts and Metrics


Book Description

Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinating connections - in diverse fields: in graph theory, combinatorial optimization, geometry of numbers, combinatorial matrix theory, statistical physics, VLSI design etc. This book presents a wealth of results, from different mathematical disciplines, in a unified comprehensive manner, and establishes new and old links, which cannot be found elsewhere. It provides a unique and invaluable source for researchers and graduate students. From the Reviews: "This book is definitely a milestone in the literature of integer programming and combinatorial optimization. It draws from the Interdisciplinarity of these fields [...]. With knowledge about the relevant terms, one can enjoy special subsections without being entirely familiar with the rest of the chapter. This makes it not only an interesting research book but even a dictionary. [...] The longer one works with it, the more beautiful it becomes." Optima 56, 1997.




Generalizations Of Finite Metrics And Cuts


Book Description

This book introduces oriented version of metrics and cuts and their multidimensional analogues, as well as partial metrics and weighted metrics. It is a follow-up of Geometry of Cuts and Metrics by Deza and Laurent which presents rich theory of classical binary and symmetric objects — metrics and cuts.Many research publications on this subject are devoted to different special aspects of the theory of generalized metrics. However, they are disconnected one from other, often written in different mathematical language, consider the same objects from different points of view without analysis of possible connections, etc. In this book we will construct full theory of main classes of finite generalized metrics and their polyhedral aspects.




Discrete and Computational Geometry


Book Description

This book constitutes the thoroughly refereed post-proceedings of the Japanese Conference on Discrete Computational Geometry, JCDCG 2001, held in Tokyo, Japan in November 2001. The 35 revised papers presented were carefully reviewed and selected. Among the topics covered are polygons and polyhedrons, divissible dissections, convex polygon packings, symmetric subsets, convex decompositions, graph drawing, graph computations, point sets, approximation, Delauny diagrams, triangulations, chromatic numbers, complexity, layer routing, efficient algorithms, and illumination problems.




Pure Metric Geometry


Book Description

This book serves as an introductory asset for learning metric geometry by delivering an in-depth examination of key constructions and providing an analysis of universal spaces, injective spaces, the Gromov-Hausdorff convergence, and ultralimits. This book illustrates basic examples of domestic affairs of metric spaces, this includes Alexandrov geometry, geometric group theory, metric-measure spaces and optimal transport. Researchers in metric geometry will find this book appealing and helpful, in addition to graduate students in mathematics, and advanced undergraduate students in need of an introduction to metric geometry. Any previous knowledge of classical geometry, differential geometry, topology, and real analysis will be useful in understanding the presented topics.




Handbook of Geometric Constraint Systems Principles


Book Description

The Handbook of Geometric Constraint Systems Principles is an entry point to the currently used principal mathematical and computational tools and techniques of the geometric constraint system (GCS). It functions as a single source containing the core principles and results, accessible to both beginners and experts. The handbook provides a guide for students learning basic concepts, as well as experts looking to pinpoint specific results or approaches in the broad landscape. As such, the editors created this handbook to serve as a useful tool for navigating the varied concepts, approaches and results found in GCS research. Key Features: A comprehensive reference handbook authored by top researchers Includes fundamentals and techniques from multiple perspectives that span several research communities Provides recent results and a graded program of open problems and conjectures Can be used for senior undergraduate or graduate topics course introduction to the area Detailed list of figures and tables About the Editors: Meera Sitharam is currently an Associate Professor at the University of Florida’s Department of Computer & Information Science and Engineering. She received her Ph.D. at the University of Wisconsin, Madison. Audrey St. John is an Associate Professor of Computer Science at Mount Holyoke College, who received her Ph. D. from UMass Amherst. Jessica Sidman is a Professor of Mathematics on the John S. Kennedy Foundation at Mount Holyoke College. She received her Ph.D. from the University of Michigan.




Handbook of Discrete and Computational Geometry


Book Description

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.




Handbook of Discrete and Computational Geometry, Second Edition


Book Description

While high-quality books and journals in this field continue to proliferate, none has yet come close to matching the Handbook of Discrete and Computational Geometry, which in its first edition, quickly became the definitive reference work in its field. But with the rapid growth of the discipline and the many advances made over the past seven years, it's time to bring this standard-setting reference up to date. Editors Jacob E. Goodman and Joseph O'Rourke reassembled their stellar panel of contributors, added manymore, and together thoroughly revised their work to make the most important results and methods, both classic and cutting-edge, accessible in one convenient volume. Now over more then 1500 pages, the Handbook of Discrete and Computational Geometry, Second Edition once again provides unparalleled, authoritative coverage of theory, methods, and applications. Highlights of the Second Edition: Thirteen new chapters: Five on applications and others on collision detection, nearest neighbors in high-dimensional spaces, curve and surface reconstruction, embeddings of finite metric spaces, polygonal linkages, the discrepancy method, and geometric graph theory Thorough revisions of all remaining chapters Extended coverage of computational geometry software, now comprising two chapters: one on the LEDA and CGAL libraries, the other on additional software Two indices: An Index of Defined Terms and an Index of Cited Authors Greatly expanded bibliographies




Geometric Science of Information


Book Description

This book constitutes the refereed proceedings of the First International Conference on Geometric Science of Information, GSI 2013, held in Paris, France, in August 2013. The nearly 100 papers presented were carefully reviewed and selected from numerous submissions and are organized into the following thematic sessions: Geometric Statistics on Manifolds and Lie Groups, Deformations in Shape Spaces, Differential Geometry in Signal Processing, Relational Metric, Discrete Metric Spaces, Computational Information Geometry, Hessian Information Geometry I and II, Computational Aspects of Information Geometry in Statistics, Optimization on Matrix Manifolds, Optimal Transport Theory, Probability on Manifolds, Divergence Geometry and Ancillarity, Entropic Geometry, Tensor-Valued Mathematical Morphology, Machine/Manifold/Topology Learning, Geometry of Audio Processing, Geometry of Inverse Problems, Algebraic/Infinite dimensional/Banach Information Manifolds, Information Geometry Manifolds, and Algorithms on Manifolds.




Surveys on Discrete and Computational Geometry


Book Description

This volume contains nineteen survey papers describing the state of current research in discrete and computational geometry as well as a set of open problems presented at the 2006 AMS-IMS-SIAM Summer Research Conference Discrete and Computational Geometry--Twenty Years Later, held in Snowbird, Utah, in June 2006. Topics surveyed include metric graph theory, lattice polytopes, the combinatorial complexity of unions of geometric objects, line and pseudoline arrangements, algorithmic semialgebraic geometry, persistent homology, unfolding polyhedra, pseudo-triangulations, nonlinear computational geometry, $k$-sets, and the computational complexity of convex bodies.




Poset Codes: Partial Orders, Metrics and Coding Theory


Book Description

This book offers an organized and systematic approach to poset metrics and codes. Poset metrics, or metrics on a vector field determined by a partial order over a finite set, were first introduced in the mid-1990s by the mathematicians Richard A. Brualdi, Janine S. Graves and K. Mark Lawrence, and to date the relevant knowledge on this subject was spread over more than two hundred research papers. Poset metrics generalizes both the standard Hamming metric – the most important metric used in the context of coding theory – and the Niederreiter-Rosenbloom-Tsfasman metric, which is an ultrametric. Conceived to be as self-contained as possible, the book starts from basic concepts of coding theory and advances towards coding theory for poset metrics and generalizations. Each chapter includes a survey of the topic presented and a list of exercises, drawn in part from recently proven results. This work will appeal to researchers and graduate students alike, particularly those in the fields of Mathematics, Electrical Engineering and Computer Sciences, with an interest in discrete geometry and coding theory.