33 research outputs found

    Characterization of hv-Convex Sequences

    Get PDF
    Reconstructing a discrete object by means of X-rays along a finite set U of (discrete) directions represents one of the main task in discrete tomography. Indeed, it is an ill-posed inverse problem, since different structures exist having the same projections along all lines whose directions range in U. Characteristic of ambiguous reconstructions are special configurations, called switching components, whose understanding represents a main issue in discrete tomography, and an independent interesting geometric problem as well. The investigation of switching component usually bases on some kind of prior knowledge that is incorporated in the tomographic problem. In this paper, we focus on switching components under the constraint of convexity along the horizontal and the vertical directions imposed to the unknown object. Moving from their geometric characterization in windows and curls, we provide a numerical description, by encoding them as special sequences of integers. A detailed study of these sequences leads to the complete understanding of their combinatorial structure, and to a polynomial-time algorithm that explicitly reconstructs any of them from a pair of integers arbitrarily given

    On Some Geometric Aspects of the Class of hv-Convex Switching Components

    Get PDF
    In the usual aim of discrete tomography, the reconstruction of an unknown discrete set is considered, by means of projection data collected along a set U of discrete directions. Possible ambiguous reconstructions can arise if and only if switching components occur, namely, if and only if non-empty images exist having null projections along all the directions in U. In order to lower the number of allowed reconstructions, one tries to incorporate possible extra geometric constraints in the tomographic problem. In particular, the class P of horizontally and vertically convex connected sets (briefly, hv-convex polyominoes) has been largely considered. In this paper we introduce the class of hv-convex switching components, and prove some preliminary results on their geometric structure. The class includes all switching components arising when the tomographic problem is considered in P, which highly motivates the investigation of such configurations. It turns out that the considered class can be partitioned in two disjointed subclasses of closed patterns, called windows and curls, respectively. It follows that all windows have a unique representation, while curls consist of interlaced sequences of sub-patterns, called Z-paths, which leads to the problem of understanding the combinatorial structure of such sequences. We provide explicit constructions of families of curls associated to some special sequences, and also give additional details on further allowed or forbidden configurations by means of a number of illustrative examples

    On the Reconstruction of Static and Dynamic Discrete Structures

    Get PDF
    We study inverse problems of reconstructing static and dynamic discrete structures from tomographic data (with a special focus on the `classical' task of reconstructing finite point sets in Rd\mathbb{R}^d). The main emphasis is on recent mathematical developments and new applications, which emerge in scientific areas such as physics and materials science, but also in inner mathematical fields such as number theory, optimization, and imaging. Along with a concise introduction to the field of discrete tomography, we give pointers to related aspects of computerized tomography in order to contrast the worlds of continuous and discrete inverse problems

    Structures from Distances in Two and Three Dimensions using Stochastic Proximity Embedding

    Get PDF
    The point placement problem is to determine the locations of a set of distinct points uniquely (up to translation and reflection) by making the fewest possible pairwise distance queries of an adversary. Deterministic and randomized algorithms are available if distances are known exactly. In this thesis, we discuss a 1-round algorithm for approximate point placement in the plane in an adversarial model. The distance query graph presented to the adversary is chordal. The remaining distances are uniquely determined using the Stochastic Proximity Embedding (SPE) method due to Agrafiotis, and the layout of the points is also generated from SPE. We have also computed the distances uniquely using a distance matrix completion algorithm for chordal graphs, based on a result by Bakonyi and Johnson. The layout of the points is determined using the traditional Young- Householder approach. We compared the layout of both the method and discussed briefly inside. The modified version of SPE is proposed to overcome the highest translation embedding that the method faces when dealing with higher learning rates. We also discuss the computation of molecular structures in three-dimensional space, with only a subset of the pairwise atomic distances available. The subset of distances is obtained using the Philips model for creating artificial backbone chain of molecular structures. We have proposed the Degree of Freedom Approach to solve this problem and carried out our implementation using SPE and the Distance matrix completion Approac

    Ghosts in Discrete Tomography

    Get PDF

    A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino

    Get PDF
    A plane tiling consisting of congruent copies of a shape is isohedral provided that for any pair of copies, there exists a symmetry of the tiling mapping one copy to the other. We give a O(n log2 n)-time algorithm for deciding if a polyomino with n edges can tile the plane isohedrally. This improves on the O(n18)-time algorithm of Keating and Vince and generalizes recent work by Brlek, Provençal, Fédou, and the second author.SCOPUS: cp.pinfo:eu-repo/semantics/publishe

    Well-formed scales, non-well-formed words and the Christoffel duality

    Get PDF
    Tesis inédita de la Universidad Complutense de Madrid, Facultad de Ciencias Matemáticas, leída el 02-02-2016La presente tesis analiza las escalas musicales generadas desde la perspectiva y las técnicas que ofrece la combinatoria algebraica de palabras. La noción de escala musical es una de las más primitivas: intuitivamente se puede reducir a un conjunto de notas ordenadas seg un la frecuencia de su fundamental (altura del sonido). Ya desde tiempos de la Escuela Pitagórica se vio que al pulsar una cuerda tensa, los sonidos que mejor suenan juntos, los más consonantes, están determinados por unas longitudes de cuerda cuyas proporciones son números fraccionarios sencillos. El más consonante de ellos, la octava, tiene una relación de longitudes 2:1. Este intervalo es tan consonante, que muchas veces los sonidos cuyas frecuencias están separadas en una octava suenan indistinguibles. Es por ello por lo que al estudiar las escalas se suelen identificar las notas cuya distancia es de una o varias octavas. Como resultado, suele entenderse por escala un conjunto de notas dentro de un rango de una octava, transportando dicha secuencia al resto de octavas en caso de necesidad. La definición formal de escala se llevar a a cabo en la sección 2.2, donde se mostrar a como cada octava puede representarse geométricamente mediante una circunferencia unitaria o, aritméticamente, como el conjunto cociente R=Z, es decir, como el intervalo (0,1]. De esta forma, una escala queda determinada por un conjunto de números ordenados entre el 0 y el 1 o bien, geométricamente, por un polígono inscrito en el círculo unidad...Fac. de Ciencias MatemáticasTRUEunpu
    corecore