A new linear convex hull algorithm for simple polygons (Corresp.)

Authors:
B. Bhattaeharya;H. Elgindy
Affiliations:
-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 2

Three problems about simple polygons

Computational Geometry: Theory and Applications
Computational and structural advantages of circular boundary representation

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	754.84

Visualization

Abstract

A new optimal algorithm for computing the convex hull of a simple polygon in the plane, along with a proof of correctness, is presented. The main novelty of the proposed algorithm is its use of existing concepts such as the unimodality of the area of a triangle inscribed in a convex polygon and Sldansky's scan. The combination of these concepts gives us new insight into the problem.