354 research outputs found

    Three dimensional loop quantum gravity: physical scalar product and spin foam models

    Full text link
    In this paper, we address the problem of the dynamics in three dimensional loop quantum gravity with zero cosmological constant. We construct a rigorous definition of Rovelli's generalized projection operator from the kinematical Hilbert space--corresponding to the quantization of the infinite dimensional kinematical configuration space of the theory--to the physical Hilbert space. In particular, we provide the definition of the physical scalar product which can be represented in terms of a sum over (finite) spin-foam amplitudes. Therefore, we establish a clear-cut connection between the canonical quantization of three dimensional gravity and spin-foam models. We emphasize two main properties of the result: first that no cut-off in the kinematical degrees of freedom of the theory is introduced (in contrast to standard `lattice' methods), and second that no ill-defined sum over spins (`bubble' divergences) are present in the spin foam representation.Comment: Typos corrected, version appearing in Class. Quant. Gra

    Homeomorphic Tetrahedralization of Multi-material Images with Quality and Fidelity Guarantees

    Get PDF
    We present a novel algorithm for generating three-dimensional unstructured tetrahedral meshes of multi-material images. The algorithm produces meshes with high quality since it provides a guaranteed dihedral angle bound of up to 19.47° for the output tetrahedra. In addition, it allows for user-specified guaranteed bounds on the two-sided Hausdorff distance between the boundaries of the mesh and the boundaries of the materials. Moreover, the mesh boundary is proved to be homeomorphic to the object surface. The algorithm is fast and robust, it produces a sufficiently small number of mesh elements that comply with these guarantees, as compared to other software. The theory and effectiveness of our method are illustrated with the experimental evaluation on synthetic and real medical data

    Ghost on the Shell: An Expressive Representation of General 3D Shapes

    Full text link
    The creation of photorealistic virtual worlds requires the accurate modeling of 3D surface geometry for a wide range of objects. For this, meshes are appealing since they 1) enable fast physics-based rendering with realistic material and lighting, 2) support physical simulation, and 3) are memory-efficient for modern graphics pipelines. Recent work on reconstructing and statistically modeling 3D shape, however, has critiqued meshes as being topologically inflexible. To capture a wide range of object shapes, any 3D representation must be able to model solid, watertight, shapes as well as thin, open, surfaces. Recent work has focused on the former, and methods for reconstructing open surfaces do not support fast reconstruction with material and lighting or unconditional generative modelling. Inspired by the observation that open surfaces can be seen as islands floating on watertight surfaces, we parameterize open surfaces by defining a manifold signed distance field on watertight templates. With this parameterization, we further develop a grid-based and differentiable representation that parameterizes both watertight and non-watertight meshes of arbitrary topology. Our new representation, called Ghost-on-the-Shell (G-Shell), enables two important applications: differentiable rasterization-based reconstruction from multiview images and generative modelling of non-watertight meshes. We empirically demonstrate that G-Shell achieves state-of-the-art performance on non-watertight mesh reconstruction and generation tasks, while also performing effectively for watertight meshes.Comment: Technical Report (26 pages, 16 figures, Project Page: https://gshell3d.github.io/

    Wavelet representation of contour sets

    Get PDF
    Journal ArticleWe present a new wavelet compression and multiresolution modeling approach for sets of contours (level sets). In contrast to previous wavelet schemes, our algorithm creates a parametrization of a scalar field induced by its contours and compactly stores this parametrization rather than function values sampled on a regular grid. Our representation is based on hierarchical polygon meshes with subdivision connectivity whose vertices are transformed into wavelet coefficients. From this sparse set of coefficients, every set of contours can be efficiently reconstructed at multiple levels of resolution. When applying lossy compression, introducing high quantization errors, our method preserves contour topology, in contrast to compression methods applied to the corresponding field function. We provide numerical results for scalar fields defined on planar domains. Our approach generalizes to volumetric domains, time-varying contours, and level sets of vector fields
    corecore