The circle is computed, starting from an initial point, by covering a small neighborhood of the initial point with a mapping of an interval from the tangent line to the circle. The projection of an endpoint of the interval is then used to select a new point on the circle.

As each new point is added, the intervals around each point are shortened so that the projection of the intervals do not overlap (approximate). Endpoints of the original intervals are then eligible for use to generate a new point. The shortening is done by projecting one interval into the tangent lines at nearby points. The algorithm terminates when there are no longer any endpoints that an be selected.

The result is a set of points on the circle, and a set of edges connecting the centers of intersecting intervals.

[Research home page]

[ **IBM home page** |
**Order** |
**Privacy** |
**ContactIBM** |
**Legal** ]