Efficient error control in 3D mesh coding

Our recently proposed wavelet-based L-infinite-constrained coding approach for meshes ensures that the maximum error between the vertex positions in the original and decoded meshes is guaranteed to be lower than a given upper bound. Instantiations of both L-2 and L-infinite coding approaches are demonstrated for MESHGRID, which is a scalable 3D object encoding system, part of MPEG-4 AFX. In this survey paper, we compare the novel L-infinite distortion estimator against the L-2 distortion estimator which is typically employed in 3D mesh coding systems. In addition, we show that, under certain conditions, the L-infinite estimator can be exploited to approximate the Hausdorff distance in real-time implementation

The mechanical response of cellular materials with spinodal topologies

The mechanical response of cellular materials with spinodal topologies is numerically and experimentally investigated. Spinodal microstructures are generated by the numerical solution of the Cahn-Hilliard equation. Two different topologies are investigated: "solid models," where one of the two phases is modeled as a solid material and the remaining volume is void space; and "shell models," where the interface between the two phases is assumed to be a solid shell, with the rest of the volume modeled as void space. In both cases, a wide range of relative densities and spinodal characteristic feature sizes are investigated. The topology and morphology of all the numerically generated models are carefully characterized to extract key geometrical features and ensure that the distribution of curvatures and the aging law are consistent with the physics of spinodal decomposition. Finite element meshes are generated for each model, and the uniaxial compressive stiffness and strength are extracted. We show that while solid spinodal models in the density range of 30-70% are relatively inefficient (i.e., their strength and stiffness exhibit a high-power scaling with relative density), shell spinodal models in the density range of 0.01-1% are exceptionally stiff and strong. Spinodal shell materials are also shown to be remarkably imperfection insensitive. These findings are verified experimentally by in-situ uniaxial compression of polymeric samples printed at the microscale by Direct Laser Writing (DLW). At low relative densities, the strength and stiffness of shell spinodal models outperform those of most lattice materials and approach theoretical bounds for isotropic cellular materials. Most importantly, these materials can be produced by self-assembly techniques over a range of length scales, providing unique scalability

One machine, one minute, three billion tetrahedra

This paper presents a new scalable parallelization scheme to generate the 3D Delaunay triangulation of a given set of points. Our first contribution is an efficient serial implementation of the incremental Delaunay insertion algorithm. A simple dedicated data structure, an efficient sorting of the points and the optimization of the insertion algorithm have permitted to accelerate reference implementations by a factor three. Our second contribution is a multi-threaded version of the Delaunay kernel that is able to concurrently insert vertices. Moore curve coordinates are used to partition the point set, avoiding heavy synchronization overheads. Conflicts are managed by modifying the partitions with a simple rescaling of the space-filling curve. The performances of our implementation have been measured on three different processors, an Intel core-i7, an Intel Xeon Phi and an AMD EPYC, on which we have been able to compute 3 billion tetrahedra in 53 seconds. This corresponds to a generation rate of over 55 million tetrahedra per second. We finally show how this very efficient parallel Delaunay triangulation can be integrated in a Delaunay refinement mesh generator which takes as input the triangulated surface boundary of the volume to mesh

A survey of real-time crowd rendering

In this survey we review, classify and compare existing approaches for real-time crowd rendering. We first overview character animation techniques, as they are highly tied to crowd rendering performance, and then we analyze the state of the art in crowd rendering. We discuss different representations for level-of-detail (LoD) rendering of animated characters, including polygon-based, point-based, and image-based techniques, and review different criteria for runtime LoD selection. Besides LoD approaches, we review classic acceleration schemes, such as frustum culling and occlusion culling, and describe how they can be adapted to handle crowds of animated characters. We also discuss specific acceleration techniques for crowd rendering, such as primitive pseudo-instancing, palette skinning, and dynamic key-pose caching, which benefit from current graphics hardware. We also address other factors affecting performance and realism of crowds such as lighting, shadowing, clothing and variability. Finally we provide an exhaustive comparison of the most relevant approaches in the field.Peer ReviewedPostprint (author's final draft

Source coding for transmission of reconstructed dynamic geometry: a rate-distortion-complexity analysis of different approaches

Live 3D reconstruction of a human as a 3D mesh with commodity electronics is becoming a reality. Immersive applications (i.e. cloud gaming, tele-presence) benefit from effective transmission of such content over a bandwidth limited link. In this paper we outline different approaches for compressing live reconstructed mesh geometry based on distributing mesh reconstruction functions between sender and receiver. We evaluate rate-performance-complexity of different configurations. First, we investigate 3D mesh compression methods (i.e. dynamic/static) from MPEG-4. Second, we evaluate the option of using octree based point cloud compression and receiver side surface reconstruction