The Definition and Computation of a Metric on Plane Curves. The Meaning of a Face on a Geometric Model

Two topics in topology, the comparison of plane curves and faces on geometric models, are discussed. With regard to the first problem, a curve is defined to be a locus of points without any underlying parameterization. A metric on a class of plane curves is defined, a finite computation of this metric is given for the case of piecewise linear curves, and it is shown how to approximate curves that have bounded curvature by piecewise linear curves. In this way a bound on the distance between two curves can be computed. With regard to the second problem, the questions to be discussed are under what circumstances do geometrical faces make sense; how can they be explicity defined; and when are these geometrical faces homeomorphic to the realization of the abstract (topological) face

Reconstruction of freeform surfaces for metrology

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

Geometric approach to sampling and communication

Relationships that exist between the classical, Shannon-type, and geometric-based approaches to sampling are investigated. Some aspects of coding and communication through a Gaussian channel are considered. In particular, a constructive method to determine the quantizing dimension in Zador's theorem is provided. A geometric version of Shannon's Second Theorem is introduced. Applications to Pulse Code Modulation and Vector Quantization of Images are addressed.Comment: 19 pages, submitted for publicatio

Importance and effectiveness of representing the shapes of Cosserat rods and framed curves as paths in the special Euclidean algebra

We discuss how the shape of a special Cosserat rod can be represented as a path in the special Euclidean algebra. By shape we mean all those geometric features that are invariant under isometries of the three-dimensional ambient space. The representation of the shape as a path in the special Euclidean algebra is intrinsic to the description of the mechanical properties of a rod, since it is given directly in terms of the strain fields that stimulate the elastic response of special Cosserat rods. Moreover, such a representation leads naturally to discretization schemes that avoid the need for the expensive reconstruction of the strains from the discretized placement and for interpolation procedures which introduce some arbitrariness in popular numerical schemes. Given the shape of a rod and the positioning of one of its cross sections, the full placement in the ambient space can be uniquely reconstructed and described by means of a base curve endowed with a material frame. By viewing a geometric curve as a rod with degenerate point-like cross sections, we highlight the essential difference between rods and framed curves, and clarify why the family of relatively parallel adapted frames is not suitable for describing the mechanics of rods but is the appropriate tool for dealing with the geometry of curves.Comment: Revised version; 25 pages; 7 figure

Evaluating the boundary and covering degree of planar Minkowski sums and other geometrical convolutions

AbstractAlgorithms are developed, based on topological principles, to evaluate the boundary and “internal structure” of the Minkowski sum of two planar curves. A graph isotopic to the envelope curve is constructed by computing its characteristic points. The edges of this graph are in one-to-one correspondence with a set of monotone envelope segments. A simple formula allows a degree to be assigned to each face defined by the graph, indicating the number of times its points are covered by the Minkowski sum. The boundary can then be identified with the set of edges that separate faces of zero and non-zero degree, and the boundary segments corresponding to these edges can be approximated to any desired geometrical accuracy. For applications that require only the Minkowski sum boundary, the algorithm minimizes geometrical computations on the “internal” envelope edges, that do not contribute to the final boundary. In other applications, this internal structure is of interest, and the algorithm provides comprehensive information on the covering degree for different regions within the Minkowski sum. Extensions of the algorithm to the computation of Minkowski sums in R3, and other forms of geometrical convolution, are briefly discussed

Quantum Gravity, Dynamical Triangulation and Higer Derivative Regularization

We consider a discrete model of euclidean quantum gravity in four dimensions based on a summation over random simplicial manifolds. The action used is the Einstein-Hilbert action plus an $R^2$-term. The phase diagram as a function of the bare coupling constants is studied in the search for a sensible continuum limit. For small values of the coupling constant of the $R^2$ term the model seems to belong to the same universality class as the model with pure Einstein-Hilbert action and exhibits the same phase transition. The order of the transition may be second or higher. The average curvature is positive at the phase transition, which makes it difficult to understand the possible scaling relations of the model.Comment: 27 pages (Latex), figures not included. Post script file containing 15 figures (1000 blocks) available from [email protected]

A Multiscale Guide to Brownian Motion

We revise the Levy's construction of Brownian motion as a simple though still rigorous approach to operate with various Gaussian processes. A Brownian path is explicitly constructed as a linear combination of wavelet-based "geometrical features" at multiple length scales with random weights. Such a wavelet representation gives a closed formula mapping of the unit interval onto the functional space of Brownian paths. This formula elucidates many classical results about Brownian motion (e.g., non-differentiability of its path), providing intuitive feeling for non-mathematicians. The illustrative character of the wavelet representation, along with the simple structure of the underlying probability space, is different from the usual presentation of most classical textbooks. Similar concepts are discussed for fractional Brownian motion, Ornstein-Uhlenbeck process, Gaussian free field, and fractional Gaussian fields. Wavelet representations and dyadic decompositions form the basis of many highly efficient numerical methods to simulate Gaussian processes and fields, including Brownian motion and other diffusive processes in confining domains