Journal Article10.1016/0196-6774(83)90013-5
Finding the convex hull of a simple polygon
Ron Graham,F. Frances Yao +1 more
TL;DR: 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.
read more
About: This article is published in Journal of Algorithms. The article was published on 01 Dec 1983. The article focuses on the topics: Convex set & Convex hull.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
t Filtering Based on S phic Filter and Localiz
Teguh Bharata Adji,Hanung Adi Nugroho,Anugera +2 more
- 01 Jan 2014
TL;DR: There are many challenges in the develop content filtering system, one of the negative content filtering systems is segmentation, where skin-color similarity problem woods, and animals which have similar color second is low light intensity problems.
Patent
Method and system for machine vision detection
Heiko Hoffmann
- 19 Jun 2020
TL;DR: In this paper, a system and computer program product are provided for determining locations of seal plugs of a connector based on image analysis, which can be used to detect an area of the connector within the acquired image, performing a thresholding operation on the area within an acquired image to obtain a mask image, and applying at least one of a blob detection or a tip detection to the output image.
Silhouette-Based Real-Time Object Detection and Tracking
Bhaumik Vaidya,Harendra Panchal,Chirag N. Paunwala +2 more
- 01 Jan 2018
TL;DR: This work proposes the best combination of detection and tracking algorithm which performs very efficiently in real time and works in all situations without the prior knowledge about number of frames.
Recognizing an Envelope of Lines in Linear Time
Eric Guévremont,Jack Snoeyink +1 more
- 16 Dec 1992
TL;DR: The envelope polygon of a set of lines, L, is the polygon consisting of the finite length segments that bound the infinite faces of the arrangement A(L) and it is shown how to sort its edges by slope in linear time.
A New Elementary Geometric Approach to Option Pricing Bounds in Discrete Time Models
Yann Braouezec,Cyril Grunspan +1 more
TL;DR: In this article, a convex hull is used to determine the no-arbitrage pricing bounds of an option (European or American) in a one-period model and is subsequently used for multi-period models.
References
An efficient algorith for determining the convex hull of a finite planar set
TL;DR: P can be chosen to I&E the centroid oC the triangle formed by X, y and z and Express each si E S in polar coordinates th origin P and 8 = 0 in the direction of zu~ arhitnry fixed half-line L from P.
1.9K
Finding the convex hull of a simple polygon
Ron Graham,F. Frances Yao +1 more
TL;DR: 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.
425
A Lower Bound to Finding Convex Hulls
TL;DR: It is shown that any algorithm in the quadratic decision-tree model must make cn log n tests for some input.
179
On finding the convex hull of a simple polygon
TL;DR: A linear time algorithm for finding the convex hull of a simple polygon that requires only one stack, instead of two, and runs more efficiently than the result of McCallum and Avis.
117