This volume is a collection of research surveys on the Distance Geometry Problem (DGP) and its applications. It will be divided into three parts: Theory, Methods and Applications. Each part will contain at least one survey and several research papers. The first part, Theory, will deal with theoretical aspects of the DGP, including a new class of problems and the study of its complexities as well as the relation between DGP and other related topics, such as: distance matrix theory, Euclidean distance matrix completion problem, multispherical structure of distance matrices, distance geometry and geometric algebra, algebraic distance geometry theory, visualization of K-dimensional structures in the plane, graph rigidity, and theory of discretizable DGP: symmetry and complexity. The second part, Methods, will discuss mathematical and computational properties of methods developed to the problems considered in the first chapter including continuous methods (based on Gaussian and hyperbolic smoothing, difference of convex functions, semidefinite programming, branch-and-bound), discrete methods (based on branch-and-prune, geometric build-up, graph rigidity), and also heuristics methods (based on simulated annealing, genetic algorithms, tabu search, variable neighborhood search). Applications will comprise the third part and will consider applications of DGP to NMR structure calculation, rational drug design, molecular dynamics simulations, graph drawing and sensor network localization. This volume will be the first edited book on distance geometry and applications. The editors are in correspondence with the major contributors to the field of distance geometry, including important research centers in molecular biology such as Institut Pasteur in Paris.

This textbook, the first of its kind, presents the fundamentals of distance geometry: theory, useful methodologies for obtaining solutions, and real world applications. Concise proofs are given and step-by-step algorithms for solving fundamental problems efficiently and precisely are presented in Mathematica®, enabling the reader to experiment with concepts and methods as they are introduced. Descriptive graphics, examples, and problems, accompany the real gems of the text, namely the applications in visualization of graphs, localization of sensor networks, protein conformation from distance data, clock synchronization protocols, robotics, and control of unmanned underwater vehicles, to name several. Aimed at intermediate undergraduates, beginning graduate students, researchers, and practitioners, the reader with a basic knowledge of linear algebra will gain an understanding of the basic theories of distance geometry and why they work in real life.

Führende Experten auf dem Gebiet der Computer-Chemie präsentieren in dem fünften Band der erfolgreichen Reihe 'Reviews in Computational Chemistry' die neuesten Entwicklungen. Um den interessierten Chemiker auf dem aktuellen Stand zu halten, ist der Reihe im Anhang eine Liste mit der Software zum Thema beigefügt

Fascinating, accessible introduction to unusual mathematical system in which distance is not measured by straight lines. Illustrated topics include applications to urban geography and comparisons to Euclidean geometry. Selected answers to problems.

This book is a text for junior, senior, or first-year graduate courses traditionally titled Foundations of Geometry and/or Non Euclidean Geometry. The first 29 chapters are for a semester or year course on the foundations of geometry. The remaining chap ters may then be used for either a regular course or independent study courses. Another possibility, which is also especially suited for in-service teachers of high school geometry, is to survey the the fundamentals of absolute geometry (Chapters 1 -20) very quickly and begin earnest study with the theory of parallels and isometries (Chapters 21 -30). The text is self-contained, except that the elementary calculus is assumed for some parts of the material on advanced hyperbolic geometry (Chapters 31 -34). There are over 650 exercises, 30 of which are 10-part true-or-false questions. A rigorous ruler-and-protractor axiomatic development of the Euclidean and hyperbolic planes, including the classification of the isometries of these planes, is balanced by the discussion about this development. Models, such as Taxicab Geometry, are used exten sively to illustrate theory. Historical aspects and alternatives to the selected axioms are prominent. The classical axiom systems of Euclid and Hilbert are discussed, as are axiom systems for three and four-dimensional absolute geometry and Pieri's system based on rigid motions. The text is divided into three parts. The Introduction (Chapters 1 -4) is to be read as quickly as possible and then used for ref erence if necessary.

This text takes a practical, step-by-step approach to algebraic curves and surface interpolation motivated by the understanding of the many practical applications in engineering analysis, approximation, and curve-plotting problems. Because of its usefulness for computing, the algebraic approach is the main theme, but a brief discussion of the synthetic approach is also presented as a way of gaining additional insight before proceeding with the algebraic manipulation. Professionals, students, and researchers in applied mathematics, solid modeling, graphics, robotics, and engineering design and analysis will find this a useful reference.

Digital geometry is about deriving geometric information from digital pictures. The field emerged from its mathematical roots some forty-years ago through work in computer-based imaging, and it is used today in many fields, such as digital image processing and analysis (with applications in medical imaging, pattern recognition, and robotics) and of course computer graphics. Digital Geometry is the first book to detail the concepts, algorithms, and practices of the discipline. This comphrehensive text and reference provides an introduction to the mathematical foundations of digital geometry, some of which date back to ancient times, and also discusses the key processes involved, such as geometric algorithms as well as operations on pictures.*A comprehensive text and reference written by pioneers in digital geometry, image processing and analysis, and computer vision*Provides a collection of state-of-the-art algorithms for a wide variety of geometrical picture analysis tasks, including extracting data from digital images and making geometric measurements on the data*Includes exercises, examples, and references to related or more advanced work