Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
|
Your cart is empty |
|||
Showing 1 - 10 of 10 matches in All Departments
Selected contributions to the Workshop WAFR 2002, held December 15-17, 2002, Nice, France. This fifth biannual Workshop on Algorithmic Foundations of Robotics focuses on algorithmic issues related to robotics and automation. The design and analysis of robot algorithms raises fundamental questions in computer science, computational geometry, mechanical modeling, operations research, control theory, and associated fields. The highly selective program highlights significant new results such as algorithmic models and complexity bounds. The validation of algorithms, design concepts, or techniques is the common thread running through this focused collection.
This book covers combinatorial data structures and algorithms, algebraic issues in geometric computing, approximation of curves and surfaces, and computational topology. Each chapter fully details and provides a tutorial introduction to important concepts and results. The focus is on methods which are both well founded mathematically and efficient in practice. Coverage includes references to open source software and discussion of potential applications of the presented techniques.
Geometric and topological inference deals with the retrieval of information about a geometric object using only a finite set of possibly noisy sample points. It has connections to manifold learning and provides the mathematical and algorithmic foundations of the rapidly evolving field of topological data analysis. Building on a rigorous treatment of simplicial complexes and distance functions, this self-contained book covers key aspects of the field, from data representation and combinatorial questions to manifold reconstruction and persistent homology. It can serve as a textbook for graduate students or researchers in mathematics, computer science and engineering interested in a geometric approach to data science.
This volume constitutes the thoroughly refereed post-conference proceedings of the 7th International Conference on Curves and Surfaces, held in Avignon, in June 2010. The conference had the overall theme: "Representation and Approximation of Curves and Surfaces and Applications." The 39 revised full papers presented together with 9 invited talks were carefully reviewed and selected from 114 talks presented at the conference. The topics addressed by the papers range from mathematical foundations to practical implementation on modern graphics processing units and address a wide area of topics such as computer-aided geometric design, computer graphics and visualisation, computational geometry and topology, geometry processing, image and signal processing, interpolation and smoothing, scattered data processing and learning theory and subdivision, wavelets and multi-resolution methods.
Selected contributions to the Workshop WAFR 2002, held December 15-17, 2002, Nice, France. This fifth biannual Workshop on Algorithmic Foundations of Robotics focuses on algorithmic issues related to robotics and automation. The design and analysis of robot algorithms raises fundamental questions in computer science, computational geometry, mechanical modeling, operations research, control theory, and associated fields. The highly selective program highlights significant new results such as algorithmic models and complexity bounds. The validation of algorithms, design concepts, or techniques is the common thread running through this focused collection.
This book covers combinatorial data structures and algorithms, algebraic issues in geometric computing, approximation of curves and surfaces, and computational topology. Each chapter fully details and provides a tutorial introduction to important concepts and results. The focus is on methods which are both well founded mathematically and efficient in practice. Coverage includes references to open source software and discussion of potential applications of the presented techniques.
The design and analysis of geometric algorithms have seen remarkable growth in recent years, due to their application in, for example, computer vision, graphics, medical imaging and CAD. The goals of this book are twofold: first to provide a coherent and systematic treatment of the foundations; secondly to present algorithmic solutions that are amenable to rigorous analysis and are efficient in practical situations. When possible, the algorithms are presented in their most general d-dimensional setting. Specific developments are given for the 2- or 3-dimensional cases when this results in significant improvements. The presentation is confined to Euclidean affine geometry, though the authors indicate whenever the treatment can be extended to curves and surfaces. The prerequisites for using the book are few, which will make it ideal for teaching advanced undergraduate or beginning graduate courses in computational geometry.
This volume constitutes the thoroughly refereed post-conference proceedings of the 8th International Conference on Curves and Surfaces, held in Paris, France, in June 2014. The conference had the overall theme: "Representation and Approximation of Curves and Surfaces and Applications". The 32 revised full papers presented were carefully reviewed and selected from 39 submissions. The scope of the conference was on following topics: approximation theory, computer-aided geometric design, computer graphics and visualization, computational geometry and topology, geometry processing, image and signal processing, interpolation and smoothing, mesh generation, finite elements and splines, scattered data processing and learning theory, sparse and high-dimensional approximation, subdivision, wavelets and multi-resolution method.
Geometric and topological inference deals with the retrieval of information about a geometric object using only a finite set of possibly noisy sample points. It has connections to manifold learning and provides the mathematical and algorithmic foundations of the rapidly evolving field of topological data analysis. Building on a rigorous treatment of simplicial complexes and distance functions, this self-contained book covers key aspects of the field, from data representation and combinatorial questions to manifold reconstruction and persistent homology. It can serve as a textbook for graduate students or researchers in mathematics, computer science and engineering interested in a geometric approach to data science.
|
You may like...
|