A New Concave Hull Algorithm and Concaveness Measure for n-dimensional Datasets

@article{Park2012ANC,
  title={A New Concave Hull Algorithm and Concaveness Measure for n-dimensional Datasets},
  author={Jin-Seo Park and Se-Jong Oh},
  journal={J. Inf. Sci. Eng.},
  year={2012},
  volume={29},
  pages={379-392}
}
Convex and concave hulls are useful concepts for a wide variety of application areas, such as pattern recognition, image processing, statistics, and classification tasks. Concave hull performs better than convex hull, but it is difficult to formulate and few algorithms are suggested. Especially, an n-dimensional concave hull is more difficult than a 2- or 3-dimensional one. In this paper, we propose a new concave hull algorithm for n-dimensional datasets. It is simple but creative. We show its… 

Figures and Tables from this paper

Alpha-Concave Hull, a Generalization of Convex Hull

It is proved that computing the alpha-concave hull is NP-hard on a set of points, which is a generalization of an NP-complete problem named minarea TSP.

Alpha Convex Hull, a Generalization of Convex Hull

It is proved that computing the alpha-concave hull is NP-hard on a set of points, which is a generalization of an NP-complete problem named min-area TSP.

A Concave Hull Based Algorithm for Object Shape Reconstruction

The algorithm is shown to be able to solve the problems of vertices connection in an efficient way by devising a new approach and has shown a competitive and more effective algorithm compared to the most efficient similar ones.

NLP Formulation for Polygon Optimization Problems

In this paper, we generalize the problems of finding simple polygons with minimum area, maximum perimeter, and maximum number of vertices, so that they contain a given set of points and their angles

Estimation of colour volumes as concave hypervolumes using α‐shapes

  • H. Gruson
  • Environmental Science
    Methods in Ecology and Evolution
  • 2020
Organisms often display multiple colour patches and for many analyses, it may be useful to take into account all these patches at the same time, and reconstruct the colour volume of the organisms.

LPCN: Least polar-angle connected node algorithm to find a polygon hull in a connected euclidean graph

...

References

SHOWING 1-10 OF 34 REFERENCES

A new algorithm for solving convex hull problem and its application to feature selection

A new method to solve the convex hull problem in n-dimensional spaces using a linear programming model and an algorithm for feature selection, which shows the effectiveness of the algorithm.

The quickhull algorithm for convex hulls

This article presents a practical convex hull algorithm that combines the two-dimensional Quickhull algorithm with the general-dimension Beneath-Beyond Algorithm, and provides empirical evidence that the algorithm runs faster when the input contains nonextreme points and that it used less memory.

Invariant feature set in convex hull for fast image registration

  • R. MinhasQ. M. Wu
  • Mathematics
    2007 IEEE International Conference on Systems, Man and Cybernetics
  • 2007
In this paper, a novel feature set in images for registration is identified and initial transformation estimate based on convex diagonals, extracted from convex hull of scene objects is refined using fine level image details to minimize errors originating from quantization.

NEAREST CONVEX HULL CLASSIFIERS FOR REMOTE SENSING CLASSIFICATION

This work deduces the NCH algorithm again basing on theories of the computational geometry, from which a simpler implementation of it is presented, and applies it to real-world remote problems and compares it with two other state-of-arts classifiers: K-NN and SVM.

Detecting textured objects using convex hull

A “direct line detection” algorithm is developed to detect line segments directly from the gray-scale image divided in small blocks, showing the effectiveness of the convex hull approach and its potential usage in industrial applications.

Concave hull: A k-nearest neighbours approach for the computation of the region occupied by a set of points

This paper describes an algorithm to compute the envelope of a set of points in a plane, which generates convex or non-convex hulls that represent the area occupied by the given points. The proposed

Robust Gift Wrapping for the Three-Dimensional Convex Hull

Nearest Neighbor Convex Hull Classification Method for Face Recognition

Experiments on face data show that the nearest neighbor convex hull approach can lead to better results than those of 1-nearest neighbor (1-NN) classifier and SVM classifiers.

Accelerating algorithm for 3D convex hulls construction

The convex hull for a set of points is consist only of a small part of the set generally. If we can remove those points lying in the interior of the hull in an efficient way,we can then construct the

Convex hull based skew estimation