Graph burning is a process to determine the spreading of information in graph. If sequence vertices burns all graph by following process, then such known as sequence. The problem consists finding minimum length for given solution this NP-hard combinatorial optimization helps quantify graph’s vulnerability contagion. This paper introduces simple farthest-first traversal-based approximatio...

This video presents an application of geodesic computation on 3D meshes to surface remeshing. The farthest point paradigm [1] is a powerful greedy algorithm that allows fast and accurate sampling of the underlying surface. The use of a varying speed function for front propagation enables an adaptive placement of the seed points. The connectivity of the resulting mesh is computed using a geodesi...

In order to identify maize purity rapidly and efficiently, the image processing technology and clustering algorithm were studied and explored in depth focused on the maize seed and characteristics of the seed images. An improved DBSCAN on the basis of farthest first traversal algorithm (FFT) adapting to maize seeds purity identification was proposed in the paper. The color features parameters o...

We present linear-time algorithms to construct tree-structured Voronoi diagrams, after the sequence of their regions at infinity or along a given boundary is known. We focus on Voronoi diagrams of line segments, including the farthest-segment Voronoi diagram, the order-(k+1) subdivision within a given order-k Voronoi region, and deleting a segment from a nearest-neighbor diagram. Although tree-...

Shape deformations preserving the intrinsic properties of a surface are called isometries. An isometry deforms a surface without tearing or stretching it, and preserves geodesic distances. We present a technique for matching point set surfaces, which is invariant with respect to isometries. A set of reference points, evenly distributed on the point set surface, is sampled by farthest point samp...

This paper gives an algorithm for polytope covering : let L and U be sets of points in R, comprising n points altogether. A cover for L from U is a set C ⊂ U with L a subset of the convex hull of C. Suppose c is the size of a smallest such cover, if it exists. The randomized algorithm given here finds a cover of size no more than c(5d ln c), for c large enough. The algorithm requires O(cn) expe...

We present a simple, first-order approximation algorithm for the support vector classification problem. Given a pair of linearly separable data sets and ∈ (0, 1), the proposed algorithm computes a separating hyperplane whose margin is within a factor of (1 − ) of that of the maximum-margin separating hyperplane. We discuss how our algorithm can be extended to nonlinearly separable and inseparab...