A Concave Hull algorithm for scattered data and its applications

Abstract

In this paper, the novel methods and problems of Concave Hull are given through the scattered points set. The -Concave Hull algorithms, which simply connected region, are proposed based on Graham's scanning of Convex Hull. By the -Hull definition, the Convex Hull is the case when . The -Concave Hull algorithms and Graham's scanning are equivalent when . The experiment of the fault plane extraction of 3D seismic showed that the algorithm is an effective method for the extracting the fault plane problems under the appropriate conditions.

Definition of graphic signatures for solid surface vibrations

“…As seen in [9] a convex analysis algorithm is applied that takes advantage of the geometric and symmetric advantages of quadrants formed in 2D spaces. The application in [10] uses a convex method that seeks to define polygonal geometry through dispersed points with reduced complexity of dispersion limits. It is also important to obtain patterns of graphical and numerical composition that predict behaviors of processed signals, with mathematical exploration beyond deterministic models.…”

“…The linearity and impulse response behavior were summarized through (10), ( 11) and ( 12), with non-linear graphical visualization in Fig. 2(b) and Fig.…”

Sifting of a Potent Convex Hull Algorithm for Scattered Point Set Using Parallel Programming

“…In scatter data the major problem is boundary problem is due to complexity of scatter data itself. By using triangular net subdivision some concave boundaries of data can be formed with different starting point [18]. Most faster method like Graham's scanning method, Jarvis March stepping method ,wrapping method, divide and conquering method and so on are improved for effective convex hull generation [19][20] [21].…”