22 citations · 33 across the 2 of their papers we have counts for
2 papers
cs.CG1999★ 11 cited
Circular Separability of Polygons
Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers +1
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 pr…
cs.CG1999★ 22 cited
Computing largest circles separating two sets of segments
Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers +2
A circle separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be l…