Author: British Library. Document Supply Centre
Publisher:
ISBN:
Category : Conference proceedings
Languages : en
Pages : 870

View

Book Description

Author: Mergenthaler Linotype Company
Publisher:
ISBN:
Category : Linotype
Languages : en
Pages : 208

View

Book Description

Author: Frank Nielsen
Publisher: Springer
ISBN: 3319470582
Category : Technology & Engineering
Languages : en
Pages : 312

View

Book Description
This book focuses on the application and development of information geometric methods in the analysis, classification and retrieval of images and signals. It provides introductory chapters to help those new to information geometry and applies the theory to several applications. This area has developed rapidly over recent years, propelled by the major theoretical developments in information geometry, efficient data and image acquisition and the desire to process and interpret large databases of digital information. The book addresses both the transfer of methodology to practitioners involved in database analysis and in its efficient computational implementation.

Author: Rolf Klein
Publisher: Springer Science & Business Media
ISBN: 9783540520559
Category : Computers
Languages : en
Pages : 182

View

Book Description
The Voronoi diagram of a set of sites is a partition of the plane into regions, one to each site, such that the region of each site contains all points of the plane that are closer to this site than to the other ones. Such partitions are of great importance to computer science and many other fields. The challenge is to compute Voronoi diagrams quickly. The problem is that their structure depends on the notion of distance and the sort of site. In this book the author proposes a unifying approach by introducing abstract Voronoi diagrams. These are based on the concept of bisecting curves, which are required to have some simple properties that are actually possessed by most bisectors of concrete Voronoi diagrams. Abstract Voronoi diagrams can be computed efficiently and there exists a worst-case efficient algorithm of divide-and-conquer type that applies to all abstract Voronoi diagrams satisfying a certain constraint. The author shows that this constraint is fulfilled by the concrete diagrams based on large classes of metrics in the plane.

Author:
Publisher:
ISBN:
Category : Mathematics
Languages : en
Pages : 732

View

Book Description

Author: J.R. Sack
Publisher: Elsevier
ISBN: 0080529682
Category : Mathematics
Languages : en
Pages : 1087

View

Book Description
Computational Geometry is an area that provides solutions to geometric problems which arise in applications including Geographic Information Systems, Robotics and Computer Graphics. This Handbook provides an overview of key concepts and results in Computational Geometry. It may serve as a reference and study guide to the field. Not only the most advanced methods or solutions are described, but also many alternate ways of looking at problems and how to solve them.

Author: Shun-ichi Amari
Publisher: American Mathematical Soc.
ISBN: 9780821843024
Category : Computers
Languages : en
Pages : 220

View

Book Description
Information geometry provides the mathematical sciences with a fresh framework of analysis. This book presents a comprehensive introduction to the mathematical foundation of information geometry. It provides an overview of many areas of applications, such as statistics, linear systems, information theory, quantum mechanics, and convex analysis.

Author: Bernard Chazelle
Publisher: Cambridge University Press
ISBN: 9780521003575
Category : Computers
Languages : en
Pages : 500

View

Book Description
The discrepancy method is the glue that binds randomness and complexity. It is the bridge between randomized computation and discrepancy theory, the area of mathematics concerned with irregularities in distributions. The discrepancy method has played a major role in complexity theory; in particular, it has caused a mini-revolution of sorts in computational geometry. This book tells the story of the discrepancy method in a few short independent vignettes. It is a varied tale which includes such topics as communication complexity, pseudo-randomness, rapidly mixing Markov chains, points on the sphere and modular forms, derandomization, convex hulls, Voronoi diagrams, linear programming and extensions, geometric sampling, VC-dimension theory, minimum spanning trees, linear circuit complexity, and multidimensional searching. The mathematical treatment is thorough and self-contained. In particular, background material in discrepancy theory is supplied as needed. Thus the book should appeal to students and researchers in computer science, operations research, pure and applied mathematics, and engineering.

Author: Hans Sagan
Publisher: Springer Science & Business Media
ISBN: 1461208718
Category : Mathematics
Languages : en
Pages : 200

View

Book Description
The subject of space-filling curves has fascinated mathematicians for over a century and has intrigued many generations of students of mathematics. Working in this area is like skating on the edge of reason. Unfortunately, no comprehensive treatment has ever been attempted other than the gallant effort by W. Sierpiriski in 1912. At that time, the subject was still in its infancy and the most interesting and perplexing results were still to come. Besides, Sierpiriski's paper was written in Polish and published in a journal that is not readily accessible (Sierpiriski [2]). Most of the early literature on the subject is in French, German, and Polish, providing an additional raison d'etre for a comprehensive treatment in English. While there was, understandably, some intensive research activity on this subject around the turn of the century, contributions have, nevertheless, continued up to the present and there is no end in sight, indicating that the subject is still very much alive. The recent interest in fractals has refocused interest on space filling curves, and the study of fractals has thrown some new light on this small but venerable part of mathematics. This monograph is neither a textbook nor an encyclopedic treatment of the subject nor a historical account, but it is a little of each. While it may lend structure to a seminar or pro-seminar, or be useful as a supplement in a course on topology or mathematical analysis, it is primarily intended for self-study by the aficionados of classical analysis.

Author: Jiri Matousek
Publisher: Springer Science & Business Media
ISBN: 1461300398
Category : Mathematics
Languages : en
Pages : 491

View

Book Description
The main topics in this introductory text to discrete geometry include basics on convex sets, convex polytopes and hyperplane arrangements, combinatorial complexity of geometric configurations, intersection patterns and transversals of convex sets, geometric Ramsey-type results, and embeddings of finite metric spaces into normed spaces. In each area, the text explains several key results and methods.