LNCS 2832 Algorithms for Graph Rigidity and Scene Analysis 1st editon by Alex Berg, Tibor Jordán ISBN 3540200649 978-3540200642

LNCS 2832 – Algorithms for Graph Rigidity and Scene Analysis is a technical book authored by Alex Berg and Tibor Jordán, published as part of the Lecture Notes in Computer Science (LNCS) series. This book focuses on the mathematical and computational techniques used in graph rigidity and its applications, particularly in the context of scene analysis in computer vision and robotics. The authors explore how graph rigidity plays a crucial role in determining the flexibility of a geometric structure and in understanding various problems related to positioning, constraints, and scene interpretation.

Graph rigidity is a key concept in computational geometry and is concerned with the study of how certain constraints on a set of points (typically in a Euclidean space) determine whether a configuration of points is rigid (unchangeable under certain movements) or flexible (can be altered without breaking constraints). The book covers algorithms that help determine the rigidity of graphs, which have applications in various fields like robotics, computer vision, geometric design, and structure-from-motion problems.

In the context of scene analysis, the book applies graph rigidity to problems in computer vision, such as reconstructing 3D scenes from 2D images, as well as analyzing the spatial relationships between objects. The algorithms discussed provide the foundation for solving practical problems in motion analysis, camera calibration, and object recognition.