Probabilistic Methods for Efficient Triangulations of the N-cube
Author : Jason Michael Ribando
Publisher :
Page : 172 pages
File Size : 19,25 MB
Release : 2000
Category :
ISBN :
Author : Jason Michael Ribando
Publisher :
Page : 172 pages
File Size : 19,25 MB
Release : 2000
Category :
ISBN :
Author :
Publisher :
Page : 842 pages
File Size : 17,86 MB
Release : 2005
Category : Dissertations, Academic
ISBN :
Author :
Publisher :
Page : 512 pages
File Size : 40,22 MB
Release : 1997
Category : Aeronautics
ISBN :
Author : Jean-Daniel Boissonnat
Publisher : Springer Science & Business Media
Page : 352 pages
File Size : 50,75 MB
Release : 2006-10-24
Category : Mathematics
ISBN : 3540332596
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.
Author : Avi Wigderson
Publisher : Princeton University Press
Page : 434 pages
File Size : 28,77 MB
Release : 2019-10-29
Category : Computers
ISBN : 0691189137
From the winner of the Turing Award and the Abel Prize, an introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography
Author : Jesus De Loera
Publisher : Springer Science & Business Media
Page : 547 pages
File Size : 12,49 MB
Release : 2010-08-16
Category : Mathematics
ISBN : 3642129714
Triangulations presents the first comprehensive treatment of the theory of secondary polytopes and related topics. The text discusses the geometric structure behind the algorithms and shows new emerging applications, including hundreds of illustrations, examples, and exercises.
Author : Franco P. Preparata
Publisher : Springer Science & Business Media
Page : 413 pages
File Size : 32,25 MB
Release : 2012-12-06
Category : Mathematics
ISBN : 1461210984
From the reviews: "This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry. ... ... The book is well organized and lucidly written; a timely contribution by two founders of the field. It clearly demonstrates that computational geometry in the plane is now a fairly well-understood branch of computer science and mathematics. It also points the way to the solution of the more challenging problems in dimensions higher than two." #Mathematical Reviews#1 "... This remarkable book is a comprehensive and systematic study on research results obtained especially in the last ten years. The very clear presentation concentrates on basic ideas, fundamental combinatorial structures, and crucial algorithmic techniques. The plenty of results is clever organized following these guidelines and within the framework of some detailed case studies. A large number of figures and examples also aid the understanding of the material. Therefore, it can be highly recommended as an early graduate text but it should prove also to be essential to researchers and professionals in applied fields of computer-aided design, computer graphics, and robotics." #Biometrical Journal#2
Author : Rajeev Motwani
Publisher : Cambridge University Press
Page : 496 pages
File Size : 40,24 MB
Release : 1995-08-25
Category : Computers
ISBN : 1139643134
For many applications a randomized algorithm is either the simplest algorithm available, or the fastest, or both. This tutorial presents the basic concepts in the design and analysis of randomized algorithms. The first part of the book presents tools from probability theory and probabilistic analysis that are recurrent in algorithmic applications. Algorithmic examples are given to illustrate the use of each tool in a concrete setting. In the second part of the book, each of the seven chapters focuses on one important area of application of randomized algorithms: data structures; geometric algorithms; graph algorithms; number theory; enumeration; parallel algorithms; and on-line algorithms. A comprehensive and representative selection of the algorithms in these areas is also given. This book should prove invaluable as a reference for researchers and professional programmers, as well as for students.
Author : Herbert Edelsbrunner
Publisher : American Mathematical Society
Page : 241 pages
File Size : 47,68 MB
Release : 2022-01-31
Category : Mathematics
ISBN : 1470467690
Combining concepts from topology and algorithms, this book delivers what its title promises: an introduction to the field of computational topology. Starting with motivating problems in both mathematics and computer science and building up from classic topics in geometric and algebraic topology, the third part of the text advances to persistent homology. This point of view is critically important in turning a mostly theoretical field of mathematics into one that is relevant to a multitude of disciplines in the sciences and engineering. The main approach is the discovery of topology through algorithms. The book is ideal for teaching a graduate or advanced undergraduate course in computational topology, as it develops all the background of both the mathematical and algorithmic aspects of the subject from first principles. Thus the text could serve equally well in a course taught in a mathematics department or computer science department.
Author :
Publisher :
Page : 852 pages
File Size : 37,35 MB
Release : 2004
Category : Mathematics
ISBN :