Pore-scale Modeling of Viscous Flow and Induced Forces in Dense Sphere Packings

We propose a method for effectively upscaling incompressible viscous flow in large random polydispersed sphere packings: the emphasis of this method is on the determination of the forces applied on the solid particles by the fluid. Pore bodies and their connections are defined locally through a regular Delaunay triangulation of the packings. Viscous flow equations are upscaled at the pore level, and approximated with a finite volume numerical scheme. We compare numerical simulations of the proposed method to detailed finite element (FEM) simulations of the Stokes equations for assemblies of 8 to 200 spheres. A good agreement is found both in terms of forces exerted on the solid particles and effective permeability coefficients

Grid models versus TIN : geometric accuracy of multibeam data processing

C

Efficient moving point handling for incremental 3D manifold reconstruction

As incremental Structure from Motion algorithms become effective, a good sparse point cloud representing the map of the scene becomes available frame-by-frame. From the 3D Delaunay triangulation of these points, state-of-the-art algorithms build a manifold rough model of the scene. These algorithms integrate incrementally new points to the 3D reconstruction only if their position estimate does not change. Indeed, whenever a point moves in a 3D Delaunay triangulation, for instance because its estimation gets refined, a set of tetrahedra have to be removed and replaced with new ones to maintain the Delaunay property; the management of the manifold reconstruction becomes thus complex and it entails a potentially big overhead. In this paper we investigate different approaches and we propose an efficient policy to deal with moving points in the manifold estimation process. We tested our approach with four sequences of the KITTI dataset and we show the effectiveness of our proposal in comparison with state-of-the-art approaches.Comment: Accepted in International Conference on Image Analysis and Processing (ICIAP 2015

Data visualization within urban models

Models of urban environments have many uses for town planning, pre-visualization of new building work and utility service planning. Many of these models are three-dimensional, and increasingly there is a move towards real-time presentation of such large models. In this paper we present an algorithm for generating consistent 3D models from a combination of data sources, including Ordnance Survey ground plans, aerial photography and laser height data. Although there have been several demonstrations of automatic generation of building models from 2D vector map data, in this paper we present a very robust solution that generates models that are suitable for real-time presentation. We then demonstrate a novel pollution visualization that uses these models

Dense point sets have sparse Delaunay triangulations

The spread of a finite set of points is the ratio between the longest and shortest pairwise distances. We prove that the Delaunay triangulation of any set of n points in R^3 with spread D has complexity O(D^3). This bound is tight in the worst case for all D = O(sqrt{n}). In particular, the Delaunay triangulation of any dense point set has linear complexity. We also generalize this upper bound to regular triangulations of k-ply systems of balls, unions of several dense point sets, and uniform samples of smooth surfaces. On the other hand, for any n and D=O(n), we construct a regular triangulation of complexity Omega(nD) whose n vertices have spread D.Comment: 31 pages, 11 figures. Full version of SODA 2002 paper. Also available at http://www.cs.uiuc.edu/~jeffe/pubs/screw.htm

Tessellations and Pattern Formation in Plant Growth and Development

The shoot apical meristem (SAM) is a dome-shaped collection of cells at the apex of growing plants from which all above-ground tissue ultimately derives. In Arabidopsis thaliana (thale cress), a small flowering weed of the Brassicaceae family (related to mustard and cabbage), the SAM typically contains some three to five hundred cells that range from five to ten microns in diameter. These cells are organized into several distinct zones that maintain their topological and functional relationships throughout the life of the plant. As the plant grows, organs (primordia) form on its surface flanks in a phyllotactic pattern that develop into new shoots, leaves, and flowers. Cross-sections through the meristem reveal a pattern of polygonal tessellation that is suggestive of Voronoi diagrams derived from the centroids of cellular nuclei. In this chapter we explore some of the properties of these patterns within the meristem and explore the applicability of simple, standard mathematical models of their geometry.Comment: Originally presented at: "The World is a Jigsaw: Tessellations in the Sciences," Lorentz Center, Leiden, The Netherlands, March 200

A tool for crowdsourced building information modeling through low-cost range camera: preliminary demonstration and potential

Within the construction sector, Building Information Models (BIMs) are more and more used thanks to the several benefits that they offer in the design of new buildings and the management of the existing ones. Frequently, however, BIMs are not available for already built constructions, but, at the same time, the range camera technology provides nowadays a cheap, intuitive and effective tool for automatically collecting the 3D geometry of indoor environments. It is thus essential to find new strategies, able to perform the first step of the scan to BIM process, by extracting the geometrical information contained in the 3D models that are so easily collected through the range cameras. In this work, a new algorithm to extract planimetries from the 3D models of rooms acquired by means of a range camera is therefore presented. The algorithm was tested on two rooms, characterized by different shapes and dimensions, whose 3D models were captured with the Occipital Structure SensorTM. The preliminary results are promising: the developed algorithm is able to model effectively the 2D shape of the investigated rooms, with an accuracy level comprised in the range of 5 - 10 cm. It can be potentially used by non-expert users in the first step of the BIM generation, when the building geometry is reconstructed, for collecting crowdsourced indoor information in the frame of BIMs Volunteered Geographic Information (VGI) generation