Henry G. Baker
- M{DDLEDITCH, A. E., STACEY, T. W., AND Tog, S.B. 1989. Intersection algorithms for lines and circles. ACM Trans. Graph. 8, I (Jan. 1989), 25-40. Google Scholar
- SCHWERDTrEGER, H. 1962. Geometry of Complex Numbers: Circle Geometry, Moebius Trans-Google Scholar
Index Terms
- Corrigenda: intersection algorithms for lines and circles
Recommendations
A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane
In this paper, a novel technique for tight outer-approximation of the intersection region of a finite number of ellipses in 2-dimensional space is proposed. First, the vertices of a tight polygon that contains the convex intersection of the ellipses are ...
Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons
SoCG '11: Proceedings of the twenty-seventh annual symposium on Computational geometryLet P be a rectilinear simple polygon. The stabbing number of a partition of P into rectangles is the maximum number of rectangles stabbed by any axis-parallel line segment inside P. We present a 3-approximation algorithm for the problem of finding a ...
Decomposition and intersection of simple splinegons
AbstractA splinegon is a polygon whose edges have been replaced by “well-behaved” curves. We show how to decompose a simple splinegon into a union of monotone pieces and into a union of differences of unions of convex pieces. We also show how to use a ...
Comments