For every scene in the Matterport3D dataset, meshes were reconstructed and rendered to provide “completed depth images” using the following process. First, each house was manually partitioned into regions roughly corresponding to rooms using an interactive floorplan drawing interface. Second, a dense point cloud was extracted containing RGB-D points (pixels) within each region, excluding pixels...

Surface reconstruction of 3d reverse engineering data through the application of a triangulated mesh is a popular method. This is because triangles are the simplest polygons for computations. The purpose of a triangular mesh is to cover the point set with a surface mesh of triangular facets. During the last decade, reverse engineering and surface reconstruction have received much attention from...

Mesh generation is a process of spatial subdivision of a generally complex domain into simple-shaped sub-volumes of pre-defined topology. These sub-volumes are usually referred to as mesh elements or cells. Elements of a mesh are connected to each other, they do not intersect with each other and cover the entire domain. The problem of generation of computational meshes arose as a pre-requisite ...

A parallel algorithm for prefix computation reported recently on interconnection network called OTIS-Mesh Of Trees[4]. Using n4 processors, algorithm shown to run in 13log n + O(1) electronic moves and 2 optical moves for n4 data points. In this paper we present new and improved parallel algorithm for prefix on OTIS-Mesh of Trees. The algorithm requires 10log n + O(1) electronic steps + 1 optic...

We use 2166 processors of the MareNostrum (IBM PowerPC 970) supercomputer to model seismic wave propagation in the inner core of the Earth following an earthquake. Simulations are performed based upon the spectral-element method, a high-degree finite-element technique with an exactly diagonal mass matrix. We use a mesh with 21 billion grid points (and therefore approximately 21 billion degrees ...

Automated segmentation of multi-part anatomical objects in images is a challenging task. In this paper, we propose a similarity-based appearance-prior to fit a compartmental geometric atlas of the mouse brain in gene expression images. A subdivision mesh which is used to model the geometry is deformed using a Markov random field (MRF) framework. The proposed appearance-prior is computed as a fu...

For grid terrain data, we propose a Lepp-surface triangulation method that starts with a coarse initial triangulation of the input data, and incrementally adds data points that reduce the worst edge approximation error in the mesh. The method generalizes a previous Lepp-centroid method in two dimensions as follows: for the edge E, having highest error in the mesh, one or two points close to (on...

The visual equivalent of human face exhibiting articulatory expression of a unit of sound in spoken language is termed as Viseme. The Visemes can be used to teach hearing impaired students visually and effectively. In this paper a method to construct three dimensional human faces from a single 2D image is proposed. By this method a generic 3D mesh of human face is deformed using the calculated ...

Delaunay meshing is a popular technique for mesh generation. Usually, the mesh has to be refined so that certain fidelity and quality criteria are met. Delaunay refinement is achieved by dynamically inserting and removing points in/from a Delaunay triangulation. In this paper, we present a robust parallel algorithm for computing Delaunay triangulations in three dimensions. Our triangulator offe...

For subdivision surfaces, it is important to characterize local shape near flat spots and points where the surface is not twice continuously differentiable. Applying general principles derived in [PR0x], this paper characterizes shape near such points for the subdivision schemes devised by Catmull and Clark and by Loop. For generic input data, both schemes fail to converge to the hyperbolic or ...