Circular Separability of Polygons

Details Circular Separability of Polygons Circular Separability of Polygons

1999-09-03

arxiv.org/abs/cs/9909007v1

Computer Science

Computational Geometry

23 pages, 7 figures, abstract presented at SODA95

Scientific paper

Two planar sets are circularly separable if there exists a circle enclosing one of the sets and whose open interior disk does not intersect the other set. This paper studies two problems related to circular separability. A linear-time algorithm is proposed to decide if two polygons are circularly separable. The algorithm outputs the smallest separating circle. The second problem asks for the largest circle included in a preprocessed, convex polygon, under some point and/or line constraints. The resulting circle must contain the query points and it must lie in the halfplanes delimited by the query lines.

Affiliated with

Also associated with

No associations

Rating

Circular Separability of Polygons does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Circular Separability of Polygons, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Circular Separability of Polygons will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-543115