This unique text/reference reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. Discussing each concept and algorithm in depth, the book includes mathematical proofs for many of the given statements. Topics and features: provides theoretical and programming exercises at the end of each chapter; presents a thorough introduction to shortest paths in Euclidean geometry, and the class of algorithms called rubberband algorithms; discusses algorithms for calculating exact or approximate ESPs in the plane; examines the shortest paths on 3D surfaces, in simple polyhedrons and in cube-curves; describes the application of rubberband algorithms for solving art gallery problems, including the safari, zookeeper, watchman, and touring polygons route problems; includes lists of symbols and abbreviations, in addition to other appendices.

This book constitutes the refereed proceedings of the 33rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2007, held in Harrachov, Czech Republic in January 2007. The 69 revised full papers, presented together with 11 invited contributions were carefully reviewed and selected from 283 submissions. The papers were organized in four topical tracks.

The Steiner tree problem is one of the most important combinatorial optimization problems. It has a long history that can be traced back to the famous mathematician Fermat (1601-1665). This book studies three significant breakthroughs on the Steiner tree problem that were achieved in the 1990s, and some important applications of Steiner tree problems in computer communication networks researched in the past fifteen years. It not only covers some of the most recent developments in Steiner tree problems, but also discusses various combinatorial optimization methods, thus providing a balance between theory and practice.

This book constitutes the refereed proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2007, held in Aachen, Germany in February 2007. The 56 revised full papers presented together with 3 invited papers address the whole range of theoretical computer science as well as current challenges like biological computing, quantum computing, and mobile and net computing.

This book constitutes the refereed proceedings of the Third International Conference on Future Data and Security Engineering, FDSE 2016, held in Can Tho City, Vietnam, in November 2016. The 28 revised full papers and 7 short papers presented were carefully reviewed and selected from 128 submissions. The accepted papers were grouped into the following sessions: Advances in query processing and optimization Big data analytics and applications Blockchains and emerging authentication techniques Data engineering tools in software development Data protection, data hiding, and access control Internet of Things and applications Security and privacy engineering Social network data analytics and recommendation systems

UNMANNED AIRCRAF T SYSTEMS UNMANNED AIRCRAF T SYSTEMS An unmanned aircraft system (UAS), sometimes called a drone, is an aircraft without a human pilot on board ??? instead, the UAS can be controlled by an operator station on the ground or may be autonomous in operation. UAS are capable of addressing a broad range of applications in diverse, complex environments. Traditionally employed in mainly military applications, recent regulatory changes around the world are leading to an explosion of interest and wide-ranging new applications for UAS in civil airspace. Covering the design, development, operation, and mission profiles of unmanned aircraft systems, this single, comprehensive volume forms a complete, stand-alone reference on the topic. The volume integrates with the online Wiley Encyclopedia of Aerospace Engineering, providing many new and updated articles for existing subscribers to that work. The chapters cover the following items: Airframe configurations and design (launch systems, power generation, propulsion) Operations (missions, integration issues, and airspace access) Coordination (multivehicle cooperation and human oversight) With contributions from leading experts, this volume is intended to be a valuable addition, and a useful resource, for aerospace manufacturers and suppliers, governmental and industrial aerospace research establishments, airline and aviation industries, university engineering and science departments, and industry analysts, consultants, and researchers.

This book constitutes the refereed proceedings of the 4th European Symposium on Algorithms, ESA '96, held in Barcelona, Spain, in September 1996. The book presents 40 revised full papers selected from 124 submissions; also are included extended abstracts of two invited presentations. The papers included cover all research areas on algorithms and their analysis as it is carried out in the fields of computer science, discrete applied and algorithmic mathematics, operations research, and all other areas of algorithms-oriented research, design and analysis.

Fundamentals of Brain Network Analysis is a comprehensive and accessible introduction to methods for unraveling the extraordinary complexity of neuronal connectivity. From the perspective of graph theory and network science, this book introduces, motivates and explains techniques for modeling brain networks as graphs of nodes connected by edges, and covers a diverse array of measures for quantifying their topological and spatial organization. It builds intuition for key concepts and methods by illustrating how they can be practically applied in diverse areas of neuroscience, ranging from the analysis of synaptic networks in the nematode worm to the characterization of large-scale human brain networks constructed with magnetic resonance imaging. This text is ideally suited to neuroscientists wanting to develop expertise in the rapidly developing field of neural connectomics, and to physical and computational scientists wanting to understand how these quantitative methods can be used to understand brain organization. - Winner of the 2017 PROSE Award in Biomedicine & Neuroscience and the 2017 British Medical Association (BMA) Award in Neurology - Extensively illustrated throughout by graphical representations of key mathematical concepts and their practical applications to analyses of nervous systems - Comprehensively covers graph theoretical analyses of structural and functional brain networks, from microscopic to macroscopic scales, using examples based on a wide variety of experimental methods in neuroscience - Designed to inform and empower scientists at all levels of experience, and from any specialist background, wanting to use modern methods of network science to understand the organization of the brain

This book constitutes selected papers from the First International Symposium on Geometry and Vision, ISGV 2021, held in Auckland, New Zealand, in January 2021. Due to the COVID-19 pandemic the conference was held in partially virtual format. The 29 papers were thoroughly reviewed and selected from 50 submissions. They cover topics in areas of digital geometry, graphics, image and video technologies, computer vision, and multimedia technologies.

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.