Applications of a two-dimensional hidden-line algorithm to other geometric problems

Recently ElGindy and Avis (EA) presented anO(n) algorithm for solving the two-dimensional hidden-line problem in ann-sided simple polygon. In this paper we show that their algorithm can be used to solve other geometric problems. In particular, triangulating anL-convex polygon and finding the convex hull of a simple polygon can be accomplished inO(n) time, whereas testing a simple polygon forL-convexity can be done inO(n2) time.ZusammenfassungKürzlich haben ElGindy und Avis (EA) einenO(n)-Algorithmus zur Lösung des Problems der verdeckten Linien in einem überschneidungsfreien Polygon vorgelegt. Hier zeigen wir, daß ihr Algorithmus auch zur Lösung anderer geometrischer Probleme verwendet werden kann. Insbesondere können wir einL-konvexes Polygon in der ZeitO(n) triangulieren und die konvexe Hülle eines überschneidungsfreien Polygons in der gleichen Zeit finden. Ferner kann die Überprüfung eines überschneidungsfreien Polygons aufL-Konvexität in der ZeitO (n2) erfolgen.

[1]  Godfried T. Toussaint,et al.  On a convex hull algorithm for polygons and its application to triangulation problems , 1982, Pattern Recognit..

[2]  Godfried T. Toussaint,et al.  PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY. , 1980 .

[3]  Jack Sklansky,et al.  Measuring Concavity on a Rectangular Mosaic , 1972, IEEE Transactions on Computers.

[4]  F. A. Valentine,et al.  Some properties of $L$-sets in the plane , 1949 .

[5]  Godfried T. Toussaint,et al.  Computational Geometric Problems in Pattern Recognition , 1982 .

[6]  Hossam A. ElGindy,et al.  A new linear convex hull algorithm for simple polygons , 1984, IEEE Trans. Inf. Theory.

[7]  D. T. Lee,et al.  On finding the convex hull of a simple polygon , 1983, International Journal of Computer & Information Sciences.

[8]  Godfried T. Toussaint,et al.  An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge , 1981, IEEE Transactions on Computers.

[9]  David Avis,et al.  A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.

[10]  D. T. Lee,et al.  An Optimal Algorithm for Finding the Kernel of a Polygon , 1979, JACM.

[11]  Robert E. Tarjan,et al.  Triangulating a Simple Polygon , 1978, Inf. Process. Lett..

[12]  Ronald L. Graham,et al.  An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[13]  Jack Sklansky,et al.  Finding the convex hull of a simple polygon , 1982, Pattern Recognit. Lett..

[14]  Godfried T. Toussaint,et al.  A counterexample to an algorithm for computing monotone hulls of simple polygons , 1983, Pattern Recognit. Lett..

[15]  David Avis,et al.  A Linear Algorithm for Finding the Convex Hull of a Simple Polygon , 1979, Inf. Process. Lett..