Circular separability of polygon

Authors:
Jean-Daniel Boissonnat;Jurek Czyzowicz;Olivier Devillers;Mariette Yvinec
Affiliations:
INRIA, 2004 Route des Lucioles, B.P.109, 06561 Valbonne, cedex, France;Département d'informatique, Université du Québec à Hull;INRIA, 2004 Route des Lucioles, B.P. 109, 06561 Valbonne, cedex, France;INRIA and Laboratoire I3S, URA CNRS 1376
Venue:
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Year:
1995

Minimum polygonal separation

Information and Computation
A linear-time algorithm for computing the Voronoi diagram of a convex polygon

Discrete & Computational Geometry
Finding minimal convex nested polygons

Information and Computation
Separation and approximation of polyhedral objects

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Intersection detection and separators for simple polygons

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Almost optimal set covers in finite VC-dimension: (preliminary version)

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Linear Programming in Linear Time When the Dimension Is Fixed

Journal of the ACM (JACM)
Convex Tours on Bounded Curvature

ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Digital disks and a digital compactness measure

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

Hi-index	0.00