A new method for simplification and compression of 3D meshes

We focus on the lossy compression of manifold triangle meshes. Our SwingWrapper approach partitions the surface of an original mesh M into simply-connected regions, called triangloids. We compute a new mesh M\u27. Each triangle of M\u27 is a close approximation of a pseudo-triangle of M. By construction, the connectivity of M\u27 is fairly regular and can be compressed to less than a bit per triangle using EdgeBreaker or one of the other recently developed schemes. The locations of the vertices of M\u27 are compactly encoded with our new prediction scheme, which uses a single correction parameter per vertex. For example, a variety of popular models retiled with our approach yield 10 times fewer triangles without exceeding an error of 1% of the radius of the bounding ball. Vertices of M\u27 are encoded with an average of 6 bits, which results in a total storage of 0.4 bits per triangle of the original mesh. The proposed solution may also be used to encode crude meshes for adaptive transmission and for controlling subdivision surfaces

Corner singularities for elliptic problems: Integral equations, graded meshes, quadrature, and compressed inverse preconditioning

We take a fairly comprehensive approach to the problem of solving elliptic partial differential equations numerically using integral equation methods on domains where the boundary has a large number of corners and branching points. Use of non-standard integral equations, graded meshes, interpolatory quadrature, and compressed inverse preconditioning are techniques that are explored, developed, mixed, and tested on some familiar problems in materials science. The recursive compressed inverse preconditioning, the major novelty of the paper, turns out to be particularly powerful and, when it applies, eliminates the need for mesh grading completely. In an electrostatic example for a multiphase granular material with about two thousand corners and triple junctions and a conductivity ratio between phases up to a million we compute a common functional of the solution with an estimated relative error of 10-12. In another example, five times as large but with a conductivity ratio of only a hundred, we achieve an estimated relative error of 10-14

High performance microfluidic rectifiers for viscoelastic fluid flow

The flow of Newtonian and non-Newtonian fluids within microfluidic rectifiers with a hyperbolic shape was investigated to assess the effect of the bounding walls on the diodicity of the microfluidic device and achieve high flow anisotropy. Three microchannels were used, with different depths and the same geometrical configuration, which creates a strong extensional flow and generates high anisotropic flow resistance between the two flow directions. The Newtonian fluid, de-ionized water, was used as a reference fluid. The viscoelastic fluid used was an aqueous solution of polyethylene oxide (0.1% w/w) with high molecular weight. The flow patterns were visualized using streak photography and the velocity field was investigated using micro-particle image velocimetry. Moreover, pressure drop measurements were performed in order to compare the diodicity achieved in the microfluidic rectifiers. For the Newtonian fluid flow, the experimental results are compared with numerical predictions obtained using a finite-volume method and good agreement was found between both approaches. For the viscoelastic fluid, significant anisotropic flow resistance can be achieved. The effect of the bounding walls was analysed and found to be qualitatively similar for all microchannels. Nevertheless, in quantitative terms, the diodicity is enhanced when the wall effect is reduced, i.e. when the channels are deeper. A maximum diodicity above six was found for the deeper channel, a value well beyond those previously reported

Enabling geometry-based 3-D tele-immersion with fast mesh compression and linear rateless coding

3-D tele-immersion (3DTI) enables participants in remote locations to share, in real time, an activity. It offers users interactive and immersive experiences, but it challenges current media-streaming solutions. Work in the past has mainly focused on the efficient delivery of image-based 3-D videos and on realistic rendering and reconstruction of geometry-based 3-D objects. The contribution of this paper is a real-time streaming component for 3DTI with dynamic reconstructed geometry. This component includes both a novel fast compression method and a rateless packet protection scheme specifically designed towards the requirements imposed by real time transmission of live-reconstructed mesh geometry. Tests on a large dataset show an encoding speed-up up to ten times at comparable compression ratio and quality, when compared with the high-end MPEG-4 SC3DMC mesh encoders. The implemented rateless code ensures complete packet loss protection of the triangle mesh object and a delivery delay within interactive bounds. Contrary to most linear fountain codes, the designed codec enables real-time progressive decoding allowing partial decoding each time a packet is received. This approach is compared with transmission over TCP in packet loss rates and latencies, typical in managed WAN and MAN networks, and heavily outperforms it in terms of end-to-end delay. The streaming component has been integrated into a larger 3DTI environment that includes state of the art 3-D reconstruction and rendering modules. This resulted in a prototype that can capture, compress transmit, and render triangle mesh geometry in real-time in realistic internet conditions as shown in experiments. Compared with alternative methods, lower interactive end-to-end delay and frame rates over three times higher are achieved

Compression of Dense and Regular Point Clouds

We present a simple technique for single-rate compression of point clouds sampled from a surface, based on a spanning tree of the points. Unlike previous methods, we predict future vertices using both a linear predictor, which uses the previous edge as a predictor for the current edge, and lateral predictors that rotate the previous edge 90 degrees left or right about an estimated normal. By careful construction of the spanning tree and choice of prediction rules, our method improves upon existing compression rates when applied to regularly sampled point sets, such as those produced by laser range scanning or uniform tesselation of higherorder surfaces. For less regular sets of points, the compression rate is still generally within 1.5 bits per point of other compression algorithms

A Global Plate Model Including Lithospheric Deformation Along Major Rifts and Orogens Since the Triassic

Global deep‐time plate motion models have traditionally followed a classical rigid plate approach, even though plate deformation is known to be significant. Here we present a global Mesozoic–Cenozoic deforming plate motion model that captures the progressive extension of all continental margins since the initiation of rifting within Pangea at ~240 Ma. The model also includes major failed continental rifts and compressional deformation along collision zones. The outlines and timing of regional deformation episodes are reconstructed from a wealth of published regional tectonic models and associated geological and geophysical data. We reconstruct absolute plate motions in a mantle reference frame with a joint global inversion using hot spot tracks for the last 80 million years and minimizing global trench migration velocities and net lithospheric rotation. In our optimized model, net rotation is consistently below 0.2°/Myr, and trench migration scatter is substantially reduced. Distributed plate deformation reaches a Mesozoic peak of 30 × 106 km2 in the Late Jurassic (~160–155 Ma), driven by a vast network of rift systems. After a mid‐Cretaceous drop in deformation, it reaches a high of 48 x 106 km2 in the Late Eocene (~35 Ma), driven by the progressive growth of plate collisions and the formation of new rift systems. About a third of the continental crustal area has been deformed since 240 Ma, partitioned roughly into 65% extension and 35% compression. This community plate model provides a framework for building detailed regional deforming plate networks and form a constraint for models of basin evolution and the plate‐mantle system

ReMESH: An interactive and user-friendly environment for remeshing surface triangulations

Research and software development involving geometry processing are often slowed down by the absence of suitable models for testing and benchmark purposes. In particular, when dealing with triangle meshes, a researcher may need to check the behavior of a new algorithm on several particular cases. In most situations, the test model is easily conceivable in mind but, at actual design time, its formalization turns out to be a much harder task than expected. Also, simple modifications over an existing triangle mesh may become a tedious work without a suitable interactive environment. In order to simplify the remeshing of existing models, we have developed a tool to interactively edit manifold triangle meshes, mostly through user friendly actions such as mouse clicks and drags

Numerical analysis of isolated end-flattened steel bars under compression in space trusses

This research aims to characterize the behavior of isolated end-flattened steel bars under compressive loading, in which global instabilities or excessive local deformations represent a significant part of the causes of structural collapse. The association of numerical analyses using the finite element method (FEM) with previously collected experimental data is performed, and their respective results are the core object of critical analysis in this work. Numerical simulations are based on the modified Riks method, complemented in part by modal analysis, whose results demonstrate the occurrence of the aforementioned failure modes in prototypes with slenderness ratios varying in the spectrum from 20 to 200. Finally, the analytical formulations that describe the phenomenon from the approach of global and local instabilities incorporated into current normative expressions are applied in a comparison with the results gathered in the numerical approach

An upwind least square formulation for free surfaces calculation of viscoplastic steady-state metal forming problems

International audienceDespite using very large parallel computers, numerical simulation of some forming processes such as multi-pass rolling, extrusion or wire drawing, need long computation time due to the very large number of time steps required to model the steady regime of the process. The direct calculation of the steady-state, whenever possible, allows reducing by 10–20 the computational effort. However, removing time from the equations introduces another unknown, the steady final shape of the domain. Among possible ways to solve this coupled multi-fields problem, this paper selects a staggered fixed-point algorithm that alternates computation of mechanical fields on a prescribed domain shape with corrections of the domain shape derived from the velocity field and the stationary condition v.n = 0. It focuses on the resolution of the second step in the frame of unstructured 3D meshes, parallel computing with domain partitioning, and complex shapes with strong contact restraints. To insure these constraints a global finite elements formulation is used. The weak formulation based on a Galerkin method of the v.n = 0 equation is found to diverge in severe tests cases. The least squares formulation experiences problems in the presence of contact restraints, upwinding being shown necessary. A new upwind least squares formulation is proposed and evaluated first on analytical solutions. Contact being a key issue in forming processes, and even more with steady formulations, a special emphasis is given to the coupling of contact equations between the two problems of the staggered algorithm, the thermo-mechanical and free surface problems. The new formulation and algorithm is finally applied to two complex actual metal forming problems of rolling. Its accuracy and robustness with respect to the shape initialization of the staggered algorithm is discussed, and its efficiency is compared to non-steady simulations