On finding the convex hull of a simple polygon

@article{Lee2004OnFT,
  title={On finding the convex hull of a simple polygon},
  author={D. T. Lee},
  journal={International Journal of Computer \& Information Sciences},
  year={2004},
  volume={12},
  pages={87-98}
}
  • D. Lee
  • Published 1 April 1983
  • Mathematics, Computer Science
  • International Journal of Computer & Information Sciences
In this paper we present a linear time algorithm for finding the convex hull of a simple polygon. Compared to the result of McCallum and Avis, our algorithm requires only one stack, instead of two, and runs more efficiently. 
Convex hulls of objects bounded by algebraic curves
TLDR
An algorithm to compute the convex hull of a curved object bounded by0(n) algebraic curve segments of maximum degreed is presented.
An Approach to the Solving Non-Steiner Minimum Link Path Problem
In this study we survey the method for fast finding a minimum link path between two arbitrary points within a simple polygon, which can pass only through the vertices, with preprocessing.
Fast Algorithm for Convex Hull of Planer Point Set
The convex hull is one of main research problems in computational geometry, it has been wildly used in computer graphics, pattern recognition, image processing, GIS and military, etc. In this paper,
Three problems about simple polygons
TLDR
A subroutine for the above result shows how to find the convex hull of any given subset of the vertices of P in linear worst-case time.
A new algorithm for computing the convex hull of a planar point set
When the edges of a convex polygon are traversed along one direction, the interior of the convex polygon is always on the same side of the edges. Based on this characteristic of convex polygons, a
Conformal geometric algebra for spherical convex hull
  • Xuehui Zhang, Li Ma
  • Mathematics
    2011 International Conference on Computer Science and Service System (CSSS)
  • 2011
For a given number of points on the plane, find a minimum set of points even as a convex polygon, which is one of the classic problems of computational geometry. The traditional method is to
Computational Geometry and its Application to Computer Graphics
  • M. Overmars
  • Computer Science
    Advances in Computer Graphics
  • 1989
The area of computational geometry deals with the study of algorithms for problems concerning geometric objects like e.g. lines, polygons, circles, etc. in the plane and in higher-dimensional space.
Numerical stability of a convex hull algorithm for simple polygons
TLDR
A numerically stable and optimalO(n)-time implementation of an algorithm for finding the convex hull of a simple polygon is presented and a concept of the condition number of simple polygons and its impact on the performance of the algorithm is discussed.
Space-E.cient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time
TLDR
It turns out that the problem is as hard as stable partition, and a simple self-contained solution is presented that uses O(log n) space and how to improve it to O(1) space with the same techniques used for stable partition is indicated.
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
TLDR
It turns out that the problem is as hard as in-place stable partition, and a simple self-contained solution is presented that uses O(log n) space and how to improve it to O(1) space with the same techniques used for stable partition is indicated.
...
1
2
3
4
...

References

SHOWING 1-10 OF 19 REFERENCES
A Linear Time Convex Hull Algorithm for Simple Polygons.
Abstract : An algorithm is presented that finds the convex hull of any orderly sequence of points in linear time. It is then shown that any simple polygon is an orderly sequence. Hence, the algorithm
Finding the Convex Hull of a Simple Polygon
TLDR
A short linear-time algorithm for finding the convex hull when the points form the (ordered) vertices of a simple (i.e., non-self-intersecting) polygon is given.
Finding the convex hull of a simple polygon
  • J. Sklansky
  • Mathematics, Computer Science
    Pattern Recognit. Lett.
  • 1982
TLDR
An earlier convex hull finder of the authors' is limited to polygons which remain simple when locally non-convex vertices are removed, so this paper amended its earlier algorithm so that it finds with complexity O(m) the convex Hull of any simple polygon, while retaining much of the simplicity of the earlier algorithm.
A New Convex Hull Algorithm for Planar Sets
A new algorithm, CONVEX, that determines which points of a planar set are vertices of the convex hull of the set is presented. It is shown that CONVEX operates in a fashion similar to the sorting
On the complexity of finding the convex hull of a set of points
  • David Avis
  • Mathematics, Computer Science
    Discret. Appl. Math.
  • 1982
Abstract An n log n lower bound is found for linear decision tree algorithms with integer inputs that either identify the convex hull of a set of points or compute its cardinality.
Convex hulls of finite sets of points in two and three dimensions
TLDR
The presented algorithms use the “divide and conquer” technique and recursively apply a merge procedure for two nonintersecting convex hulls to ensure optimal time complexity within a multiplicative constant.
A Linear Algorithm for Finding the Convex Hull of a Simple Polygon
TLDR
A new linear time algorithm for determining the convex hull of a set of n points in the plane is presented and the validity of this algorithm is proved.
An optimal real-time algorithm for planar convex hulls
TLDR
An algorithm is described for the construction in real-time of the convex hull of a set of set of points in the plane by successive updates, thereby achieving a total processing time of O(n)(log log log) for this model.
A counterexample to an algorithm for computing monotone hulls of simple polygons
TLDR
It is shown that the first step does not always work correctly and can even yield non-simple polygons, invalidating the use of the second step of the two-stage convex hull algorithm.
Measuring Concavity on a Rectangular Mosaic
  • J. Sklansky
  • Mathematics, Computer Science
    IEEE Transactions on Computers
  • 1972
A theory for describing and measuring the concavities of cellular complexes (digitized silhouettes) is developed. This theory involves the use of the minimum-perimeter polygon and its convex hull.
...
1
2
...