Convex hull algorithms is very simple. The leftmost vertex is on the convex hull and we denote it formula_6. The second point is assumed to be a candidate convex hull vertex as well. At each step one looks at three consecutive vertices of the polygon, with two first ones tentatively assigned to the growing convex hull and the third one is a new unprocessed vertex of the polygon, say, we denote this as formula_7. If the angle is convex, then formula_8 and the whole triple is shifted by one vertex along the polygon. If the resulting angle is concave, then the middle point
Lens (optics) object off the optical axis of the lens is imaged, where rays pass through the lens at an angle to the axis θ. Rays that pass through the centre of a lens of focal length "f" are focused at a point with distance from the axis. Rays passing through the outer margins of the lens are focused at different points, either further from the axis (positive coma) or closer to the axis (negative coma). In general, a bundle of parallel rays passing through the lens at a fixed distance from the centre of the lens are focused to a ring-shaped