In this paper, the computation of positiveα-hull for a set of planar closedC-continuous curves has been addressed without sampling the curves into point-sets or polylines. Positive α-hull, so far, has been computed only for a set of points, using the farthest Delaunay triangulation, a dual of farthest Voronoi diagram. However, Delaunay triangulation does not exist for a set of curved boundaries...

We investigate the higher-order Voronoi diagrams of n point sites with respect to the geodesic distance in a simple polygon with h > 0 polygonal holes and c corners. Given a set of n point sites, the korder Voronoi diagram partitions the plane into several regions such that all points in a region share the same k nearest sites. The nearest-site (first-order) geodesic Voronoi diagram has already...

Clustering; Classification; K-Means; Cluster evaluation; Data mining Abstract In this paper we present two clustering techniques called ModEx and Seed-Detective. ModEx is a modified version of an existing clustering technique called Ex-Detective. It addresses some limitations of Ex-Detective. Seed-Detective is a combination of ModEx and Simple KMeans. Seed-Detective uses ModEx to produce a set ...

In this paper we present a novel clustering technique called Seed-Detective. It is a combination of modified versions of two existing techniques namely Ex-Detective and Simple K-Means. Seed-Detective first discovers a set of preliminary clusters using our modified Ex-Detective. The modified Ex-Detective allows a data miner to assign different weights (importance levels) for all attributes, both...

In this paper we present a clustering technique called DenClust that produces high quality initial seeds through a deterministic process without requiring an user input on the number of clusters k and the radius of the clusters r. The high quality seeds are given input to K-Means as the set of initial seeds to produce the final clusters. DenClust uses a density based approach for initial seed s...

The key issue at a branch-point switch for multicasting (point-to-multipoint) available bit rate (ABR) flow control is how to consolidate backward resource management (BRM) cells returning from each branch to avoid feedback implosion. However, consolidating BRM cells at a branch point can cause undesirable effects such as consolidation noise, consolidation delay, and consolidation loss. This pa...

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...

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...