We present a novel surface mesh segmentation algorithm that, when combined with the Centroidal Voronoi Tessellation (CVT) remeshing method, produces surface meshes that more closely approximate the input surface mesh than when using CVT alone, using both topological and geometric measures of closeness. By segmenting the input surface before CVT remeshing, fewer triangles are required for the re...

As the methodology of centroidal Voronoi tessellation (CVT) is receiving more and more attention in the mesh generation community, a clear characterization of the influence of geometric constraints on the CVT-based meshing is becoming increasingly important. In this paper, we first give a precise definition of the geometrically conforming centroidal Voronoi Delaunay triangulation (CfCVDT) and t...

Finding optimal (or low energy) centroidal Voronoi tessellations (CVTs) on a two-dimensional domain is challenging problem. One must navigate an energy landscape whose desirable critical points h...

One important problem in a network G is to locate an (invisible) moving entity by using distance-detectors placed at strategical locations in G. For instance, the famous metric dimension of a graph G is the minimum number k of detectors placed in some vertices {v1, · · · , vk} such that the vector (d1, · · · , dk) of the distances d(vi, r) between the detectors and the entity’s location r allow...

In this paper, a new method of analysis for second order initial value problems using the RKButcher algorithms is presented. To illustrate the effectiveness of the RK-Butcher algorithms, seven problems of different kinds have been considered and the solutions were obtained using the RK method based on Arithmetic mean (RKAM), Centroidal mean (RKCeM) and the RK-Butcher Algorithms and are compared...