triangulation - How to calculate the super-triangular surround the set of points in Bowyer-Watson algorithm? -

first, sorry bad english. follow question, in bowyer-watson algorithm, must find super-triangular surround points. how can calculate coordinator (x,y) of 3 verticles of super-triangular ? have fomular ? much.

i don't have proof first comes mind doing getting convex hull of set of points

1. convex hull of group of points. 2. initialize variable smallest = infinity. 3. each point p in convex hull following:        find point farthest away p call q.        set n1 = point left of p (counter-clockwise along convex hull).              n2 = point right of p (clockwise along convex hull).            l1 = line intersects q , perpendicular line pq.            l2 = line intersects p , n1.            l3 = line intersects p , n2.            = area of triangle thats formed intersections of l1,l2,l3.        if < smallest, set smallest = a. 4. return smallest 

this, of course, returns number isn't helpful instead create triangle class

class triangle{     point p1;     point p2;     point p3;     double area;     //etc... } 

and change smallest triangle.area or end keeping track of points.