It was open for more than eight years to obtain an algorithm for computing the convex hull of a set of n sorted points in sub-logarithmic time on a reconfigurable mesh of size p n pn. Our main contribution is to provide the first breakthrough: we propose an almost optimal algorithm running in O((log logn)2) time on a reconfigurable mesh of size p n pn. With slight modifications this algorithm c...

Combining image processing and optimization techniques, we automatically align a lattice of points (atoms) with horizons and faults in a 3-D seismic image. Connecting these points yields an unstructured space-filling polyhedral (atomic) mesh. This single data structure can integrate multiple tasks, such as seismic interpretation, reservoir characterization, and flow simulation, thereby reducing...

Finite element derivative superconvergent points for the Poisson equation under local rectangular mesh (in the two dimensional case) and local brick mesh (in the three dimensional situation) are investigated. All superconvergent points for the finite element space of any order that is contained in the tensor-product space and contains the intermediate family can be predicted. In case of the ser...

This study presents a novel rapid and effective point simplification algorithm based on point clouds without using either normal or connectivity information. Sampled points are clustered based on shape variations by octree data structure, an inner point distribution of a cluster, to judge whether these points correlate with the coplanar characteristics. Accordingly, the relevant point from each...

We are interested in the following mesh refinement problem: given an input set of points P in R, we would like to produce a good-quality triangulation by adding new points in P . Algorithms for mesh refinement are typically incremental; they compute the Delaunay triangulation of the input, then insert points one by one. However, retriangulating after each insertion can take linear time. In this...

Wireless Mesh Networks (WMNs) are currently becoming one of the most promising approaches to provide ubiquitous broadband Internet access. This paper provides a survey on recent advances and open research issues in WMNs. Network architectures and real world testbed are described, followed by some reference applications scenario. State-of-the-art protocols for WMNs are illustrated highlighting t...

The classical approach of radio planning in wireless access networks is often tailored as a set covering problem. Such approach is no longer suited for Wireless Mesh Networks (WMNs), where, beside the problem of covering clients, also the wireless network topology must be planned and the traffic must be routed on wireless links towards mesh access points. In this paper we propose novel optimiza...

A high order accurate discontinuous galerkin method based curvedelement implementation in OpenFOAM is presented in this work. The degree of freedom points on origin straight side mesh are mapped to curvilinear edges by finding nearest points on boundary. Then the deformation are transported to the inner points by blended method. Based on the run-time dynamic code of OpenFOAM, we design a conven...

An algorithm for refining an essentially unrestricted mesh of points into a bivariate C 1 surface is given. The algorithm generalizes the construction of quadratic splines from a mesh of control points. It gives an explicit parametrization of the surface with quadratic and cubic pieces. When the mesh is regular then a quadratic spline surface is generated. Irregular input meshes with non quadri...