J.-D. Boissonnat, J. Czyzowicz, O. Devillers, and M. Yvinec. Circular separability of polygons. In Proc. 6th ACM-SIAM Sympos. Discrete Algorithms, pages 273281, 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Deterministic Algorithms for 2-d Convex Programming and 3-d Online .. - Chan (1997) (Correct)
....time will directly improve the time bound in the above theorem. As an application of Theorem 4.1, we have an online algorithm for the largest circle (in fact, the largest homothet of any simply shaped convex figure) inside an intersection of halfplanes in IR 2 . Previously, Boissonnat et al. [3] gave static data structures for finding the largest circle in a convex polygon subject to point line constraints. Corollary 4.2 The largest circle contained in an intersection of n halfplanes in IR 2 can be maintained in O(log 3 n= log log n) worst case time under a sequence of insertions. ....
J.-D. Boissonnat, J. Czyzowicz, O. Devillers, and M. Yvinec. Circular separability of polygons. In Proc. 6th ACM-SIAM Sympos. Discrete Algorithms, pages 273--281, 1995.
Computing Largest Circles Separating Two Sets of Segments - Boissonnat, Czyzowicz (1996) (5 citations) Self-citation (Boissonnat Czyzowicz Devillers Yvinec) (Correct)
No context found.
J.-D. Boissonnat, J. Czyzowicz, O. Devillers, and M. Yvinec. Circular separability of polygons. In Proc. 6th ACM-SIAM Sympos. Discrete Algorithms, pages 273281, 1995.
Computing Largest Circles Separating Two Sets of Segments - Boissonnat, Czyzowicz.. (1995) (5 citations) Self-citation (Boissonnat Czyzowicz Devillers Yvinec) (Correct)
....be locally increased while still separating the two given sets. An Theta(n log n) optimal algorithm is proposed to nd all largest circles separating two given sets of line segments when line segments are allowed to meet only at their endpoints. This settles an open problem from a previous paper[BCDY95] In the general case, when line segments may intersect Omega Gamma n 2 ) times, our algorithm can be adapted to work in O(nff(n) log n) time and O(nff(n) space, where ff(n) represents the extremely slowly growing inverse of Ackermann function. Key words: computational geometry, ....
....augmenter son rayon tout en pr#servant la propri#t# de s#paration. Nous proposons un algorithme optimal de complexit# Theta(n log n) pour trouver les plus grands cercles s#parants deux ensemble de segments sans points d intersections. Cet al..gorithme r#soud un probl#me ouvert soulev# dans [BCDY95] Dans le cas g#n#ral o# les segments se coupent, l algorithme peut #tre adapt# pour fonctionner en temps O(nff(n) log n) et avec une m#moire O(nff(n) o# ff(n) est une fonction # croissance extr#mement lente. Mots cl# : g#om#trie algorithmique, s#parabilit# Largest Circles Separating Two Sets ....
[Article contains additional citation context not shown here]
J.-D. Boissonnat, J. Czyzowicz, O. Devillers, and M. Yvinec. Circular separability of polygon. In Proc. 6th ACM-SIAM Sympos. Discrete Algorithms (SODA). 1995.
Computing Largest Circles Separating Two Sets of Segments - Boissonnat, Czyzowicz.. (1996) (5 citations) Self-citation (Boissonnat Czyzowicz Devillers Yvinec) (Correct)
....be locally increased while still separating the two given sets. An Theta(n log n) optimal algorithm is proposed to nd all largest circles separating two given sets of line segments when line segments are allowed to meet only at their endpoints. This settles an open problem from a previous paper. [3] In the gen eral case, when line segments may intersect Omega Gamma n 2 ) times, our algorithm can be adapted to work in O(nff(n) log n) time and O(nff(n) space, where ff(n) represents the extremely slowly growing inverse of Ackermann function. Keywords: Computational geometry, circles, ....
....in higher dimensions, however it does not apply to the problem of circular separabil ity of two simple polygons. In this case, the method leads to the computation of the convex hull of the seg ments of parabola in 3D which is an unsolved problem. This problem has been already considered[3] and a lin ear algorithm to nd the smallest separating circle of two polygons has been proposed. In the present paper we consider the problem of nd ing all largest circles separating two given sets of line segments. We suppose that dioeerent line segments may meet only at their endpoints. An O(n ....
[Article contains additional citation context not shown here]
J.-D. Boissonnat, J. Czyzowicz, O. Devillers, and M. Yvinec. Circular separability of polygon. In Proc. 6th ACM-SIAM Sympos. Discrete Algorithms (SODA). 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC