|
Geometric And Topological Inference
''Geometric and Topological Inference'' is a monograph in computational geometry, computational topology, geometry processing, and topological data analysis, on the problem of inferring properties of an unknown space from a finite point cloud of noisy samples from the space. It was written by Jean-Daniel Boissonnat, Frédéric Chazal, and Mariette Yvinec, and published in 2018 by the Cambridge University Press in their Cambridge Texts in Applied Mathematics book series. The Basic Library List Committee of the Mathematical Association of America has suggested its inclusion in undergraduate mathematics libraries. Topics The book is subdivided into four parts and 11 chapters. The first part covers basic tools from topology needed in the study, including simplicial complexes, Čech complexes and Vietoris–Rips complex, homotopy equivalence of topological spaces to their nerves, filtrations of complexes, and the data structures needed to represent these concepts efficiently ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geometric And Topological Inference
''Geometric and Topological Inference'' is a monograph in computational geometry, computational topology, geometry processing, and topological data analysis, on the problem of inferring properties of an unknown space from a finite point cloud of noisy samples from the space. It was written by Jean-Daniel Boissonnat, Frédéric Chazal, and Mariette Yvinec, and published in 2018 by the Cambridge University Press in their Cambridge Texts in Applied Mathematics book series. The Basic Library List Committee of the Mathematical Association of America has suggested its inclusion in undergraduate mathematics libraries. Topics The book is subdivided into four parts and 11 chapters. The first part covers basic tools from topology needed in the study, including simplicial complexes, Čech complexes and Vietoris–Rips complex, homotopy equivalence of topological spaces to their nerves, filtrations of complexes, and the data structures needed to represent these concepts efficiently ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Data Structure
In computer science, a data structure is a data organization, management, and storage format that is usually chosen for efficient access to data. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data, i.e., it is an algebraic structure about data. Usage Data structures serve as the basis for abstract data types (ADT). The ADT defines the logical form of the data type. The data structure implements the physical form of the data type. Different types of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. For example, relational databases commonly use B-tree indexes for data retrieval, while compiler implementations usually use hash tables to look up identifiers. Data structures provide a means to manage large amounts of data efficiently for uses such as large databases and internet indexing services. Usually, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
ZbMATH
zbMATH Open, formerly Zentralblatt MATH, is a major reviewing service providing reviews and abstracts for articles in pure mathematics, pure and applied mathematics, produced by the Berlin office of FIZ Karlsruhe – Leibniz Institute for Information Infrastructure GmbH. Editors are the European Mathematical Society, FIZ Karlsruhe, and the Heidelberg Academy of Sciences. zbMATH is distributed by Springer Science+Business Media. It uses the Mathematics Subject Classification codes for organising reviews by topic. History Mathematicians Richard Courant, Otto Neugebauer, and Harald Bohr, together with the publisher Ferdinand Springer, took the initiative for a new mathematical reviewing journal. Harald Bohr worked in Copenhagen. Courant and Neugebauer were professors at the University of Göttingen. At that time, Göttingen was considered one of the central places for mathematical research, having appointed mathematicians like David Hilbert, Hermann Minkowski, Carl Runge, and Felix ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
The Mathematical Gazette
''The Mathematical Gazette'' is an academic journal of mathematics education, published three times yearly, that publishes "articles about the teaching and learning of mathematics with a focus on the 15–20 age range and expositions of attractive areas of mathematics." It was established in 1894 by Edward Mann Langley as the successor to the Reports of the Association for the Improvement of Geometrical Teaching. Its publisher is the Mathematical Association. William John Greenstreet was its editor for more than thirty years (1897–1930). Since 2000, the editor is Gerry Leversha. Editors * Edward Mann Langley: 1894-1896 * Francis Sowerby Macaulay: 1896-1897 * William John Greenstreet: 1897-1930 * Alan Broadbent: 1930-1955 * Reuben Goodstein: 1956-1962 * Edwin A. Maxwell: 1962-1971 * Douglas Quadling Douglas Arthur Quadling (1926–2015) was an English mathematician, school master and educationalist who was one of the four drivers behind the School Mathematics Project (SMP) i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
MathSciNet
MathSciNet is a searchable online bibliographic database created by the American Mathematical Society in 1996. It contains all of the contents of the journal ''Mathematical Reviews'' (MR) since 1940 along with an extensive author database, links to other MR entries, citations, full journal entries, and links to original articles. It contains almost 3.6 million items and over 2.3 million links to original articles. Along with its parent publication ''Mathematical Reviews'', MathSciNet has become an essential tool for researchers in the mathematical sciences. Access to the database is by subscription only and is not generally available to individual researchers who are not affiliated with a larger subscribing institution. For the first 40 years of its existence, traditional typesetting was used to produce the Mathematical Reviews journal. Starting in 1980 bibliographic information and the reviews themselves were produced in both print and electronic form. This formed the basis of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Persistent Homology
:''See homology for an introduction to the notation.'' Persistent homology is a method for computing topological features of a space at different spatial resolutions. More persistent features are detected over a wide range of spatial scales and are deemed more likely to represent true features of the underlying space rather than artifacts of sampling, noise, or particular choice of parameters. To find the persistent homology of a space, the space must first be represented as a simplicial complex. A distance function on the underlying space corresponds to a filtration of the simplicial complex, that is a nested sequence of increasing subsets. Definition Formally, consider a real-valued function on a simplicial complex f:K \rightarrow \mathbb that is non-decreasing on increasing sequences of faces, so f(\sigma) \leq f(\tau) whenever \sigma is a face of \tau in K. Then for every a \in \mathbb the sublevel set K_a=f^((-\infty, a]) is a subcomplex of ''K'', and the ordering of th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Homology (mathematics)
In mathematics, homology is a general way of associating a sequence of algebraic objects, such as abelian groups or modules, with other mathematical objects such as topological spaces. Homology groups were originally defined in algebraic topology. Similar constructions are available in a wide variety of other contexts, such as abstract algebra, groups, Lie algebras, Galois theory, and algebraic geometry. The original motivation for defining homology groups was the observation that two shapes can be distinguished by examining their holes. For instance, a circle is not a disk because the circle has a hole through it while the disk is solid, and the ordinary sphere is not a circle because the sphere encloses a two-dimensional hole while the circle encloses a one-dimensional hole. However, because a hole is "not there", it is not immediately obvious how to define a hole or how to distinguish different kinds of holes. Homology was originally a rigorous mathematical method for defi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alpha Shape
In computational geometry, an alpha shape, or α-shape, is a family of piecewise linear simple curves in the Euclidean plane associated with the shape of a finite set of points. They were first defined by . The alpha-shape associated with a set of points is a generalization of the concept of the convex hull, i.e. every convex hull is an alpha-shape but not every alpha shape is a convex hull. Characterization For each real number ''α'', define the concept of a ''generalized disk of radius'' 1/''α'' as follows: * If ''α'' = 0, it is a closed half-plane; * If ''α'' > 0, it is a closed disk of radius 1/''α''; * If ''α'' < 0, it is the closure of the complement of a disk of radius −1/''α''. Then an edge of the alpha-shape is drawn between two members of the finite point set whenever there exists a generalized disk of radius 1/''α'' containing none of the point set and which has the property that the two points lie o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lower Envelope
In mathematics, the lower envelope or pointwise minimum of a finite set of functions is the pointwise minimum of the functions, the function whose value at every point is the minimum of the values of the functions in the given set. The concept of a lower envelope can also be extended to partial functions by taking the minimum only among functions that have values at the point. The upper envelope or pointwise maximum is defined symmetrically. For an infinite set of functions, the same notions may be defined using the infimum in place of the minimum, and the supremum in place of the maximum. For continuous functions from a given class, the lower or upper envelope is a piecewise function whose pieces are from the same class. For functions of a single real variable whose graphs have a bounded number of intersection points, the complexity of the lower or upper envelope can be bounded using Davenport–Schinzel sequences, and these envelopes can be computed efficiently by a divide-and-co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Hull Algorithms
Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science. In computational geometry, numerous algorithms are proposed for computing the convex hull of a finite set of points, with various computational complexities. Computing the convex hull means that a non-ambiguous and efficient representation of the required convex shape is constructed. The complexity of the corresponding algorithms is usually estimated in terms of ''n'', the number of input points, and sometimes also in terms of ''h'', the number of points on the convex hull. Planar case Consider the general case when the input to the algorithm is a finite unordered set of points on a Cartesian plane. An important special case, in which the points are given in the order of traversal of a simple polygon's boundary, is described later in a separate subsection. If not all points are on the same line, then their convex hull is a convex polygon whose ve ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Hull
In geometry, the convex hull or convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, or equivalently as the set of all convex combinations of points in the subset. For a bounded subset of the plane, the convex hull may be visualized as the shape enclosed by a rubber band stretched around the subset. Convex hulls of open sets are open, and convex hulls of compact sets are compact. Every compact convex set is the convex hull of its extreme points. The convex hull operator is an example of a closure operator, and every antimatroid can be represented by applying this closure operator to finite sets of points. The algorithmic problems of finding the convex hull of a finite set of points in the plane or other low-dimensional Euclidean spaces, and its dual problem of intersecting half-spaces, are fundamental problems of com ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Polytope
A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the n-dimensional Euclidean space \mathbb^n. Most texts. use the term "polytope" for a bounded convex polytope, and the word "polyhedron" for the more general, possibly unbounded object. Others''Mathematical Programming'', by Melvyn W. Jeter (1986) p. 68/ref> (including this article) allow polytopes to be unbounded. The terms "bounded/unbounded convex polytope" will be used below whenever the boundedness is critical to the discussed issue. Yet other texts identify a convex polytope with its boundary. Convex polytopes play an important role both in various branches of mathematics and in applied areas, most notably in linear programming. In the influential textbooks of Grünbaum and Ziegler on the subject, as well as in many other texts in discrete geometry, convex polytopes are often simply called "polytopes". Grünbaum points out that this is solely to avoi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
