465 research outputs found

    Algebraic Topology

    Full text link
    The chapter provides an introduction to the basic concepts of Algebraic Topology with an emphasis on motivation from applications in the physical sciences. It finishes with a brief review of computational work in algebraic topology, including persistent homology.Comment: This manuscript will be published as Chapter 5 in Wiley's textbook \emph{Mathematical Tools for Physicists}, 2nd edition, edited by Michael Grinfeld from the University of Strathclyd

    Reconstruction of freeform surfaces for metrology

    Get PDF
    The application of freeform surfaces has increased since their complex shapes closely express a product's functional specifications and their machining is obtained with higher accuracy. In particular, optical surfaces exhibit enhanced performance especially when they take aspheric forms or more complex forms with multi-undulations. This study is mainly focused on the reconstruction of complex shapes such as freeform optical surfaces, and on the characterization of their form. The computer graphics community has proposed various algorithms for constructing a mesh based on the cloud of sample points. The mesh is a piecewise linear approximation of the surface and an interpolation of the point set. The mesh can further be processed for fitting parametric surfaces (Polyworks® or Geomagic®). The metrology community investigates direct fitting approaches. If the surface mathematical model is given, fitting is a straight forward task. Nonetheless, if the surface model is unknown, fitting is only possible through the association of polynomial Spline parametric surfaces. In this paper, a comparative study carried out on methods proposed by the computer graphics community will be presented to elucidate the advantages of these approaches. We stress the importance of the pre-processing phase as well as the significance of initial conditions. We further emphasize the importance of the meshing phase by stating that a proper mesh has two major advantages. First, it organizes the initially unstructured point set and it provides an insight of orientation, neighbourhood and curvature, and infers information on both its geometry and topology. Second, it conveys a better segmentation of the space, leading to a correct patching and association of parametric surfaces.EMR

    A Growing Self-Organizing Network for Reconstructing Curves and Surfaces

    Full text link
    Self-organizing networks such as Neural Gas, Growing Neural Gas and many others have been adopted in actual applications for both dimensionality reduction and manifold learning. Typically, in these applications, the structure of the adapted network yields a good estimate of the topology of the unknown subspace from where the input data points are sampled. The approach presented here takes a different perspective, namely by assuming that the input space is a manifold of known dimension. In return, the new type of growing self-organizing network presented gains the ability to adapt itself in way that may guarantee the effective and stable recovery of the exact topological structure of the input manifold

    The persistent cosmic web and its filamentary structure I: Theory and implementation

    Full text link
    We present DisPerSE, a novel approach to the coherent multi-scale identification of all types of astrophysical structures, and in particular the filaments, in the large scale distribution of matter in the Universe. This method and corresponding piece of software allows a genuinely scale free and parameter free identification of the voids, walls, filaments, clusters and their configuration within the cosmic web, directly from the discrete distribution of particles in N-body simulations or galaxies in sparse observational catalogues. To achieve that goal, the method works directly over the Delaunay tessellation of the discrete sample and uses the DTFE density computed at each tracer particle; no further sampling, smoothing or processing of the density field is required. The idea is based on recent advances in distinct sub-domains of computational topology, which allows a rigorous application of topological principles to astrophysical data sets, taking into account uncertainties and Poisson noise. Practically, the user can define a given persistence level in terms of robustness with respect to noise (defined as a "number of sigmas") and the algorithm returns the structures with the corresponding significance as sets of critical points, lines, surfaces and volumes corresponding to the clusters, filaments, walls and voids; filaments, connected at cluster nodes, crawling along the edges of walls bounding the voids. The method is also interesting as it allows for a robust quantification of the topological properties of a discrete distribution in terms of Betti numbers or Euler characteristics, without having to resort to smoothing or having to define a particular scale. In this paper, we introduce the necessary mathematical background and describe the method and implementation, while we address the application to 3D simulated and observed data sets to the companion paper.Comment: A higher resolution version is available at http://www.iap.fr/users/sousbie together with complementary material. Submitted to MNRA

    Links of complex analytic singularities

    Full text link
    This is a part survey part research paper studying the local topology of complex analytic spaces. We review and strengthen the results of Kapovich--Koll\'ar "Fundamental groups of links of isolated singularities" (1109.4047) and incorporate the paper "Dual graphs of exceptional divisors" (1203.2640) into the current one. A new result is the characterization of the fundamental group of links of Cohen-Macaulay singularities. The last section lists numerous open problems and conjectures. Version 2: Questions 62--65 revised following comments of Shaneson and Maxim. Version 3: Many small changes, especially in section about Questions and Problems.Comment: arXiv admin note: substantial text overlap with arXiv:1203.264
    corecore