B. Chazelle and D. P. Dobkin. Intersection of convex objects in 2 and 3 dimensions. Journal of the ACM, 34:1-27, 1987. Home/Search Document Not in Database Summary ACM TOC Related Articles Check |
This paper is cited in the following contexts:
Space-Efficient Planar Convex Hull Algorithms - Brönnimann, Iacono.. (Correct)
....In the case where the largest polar angle is not unique, ties are broken by taking the farthest vertex from the previously found vertex. Finding a tangent to an individual convex hull can be done in O(log g i ) time if the vertices of the convex hull are stored in an array in clockwise order [5, 27, 30]. There are n=g i tangent nding operations per iteration and g i iterations in round i. Therefore, round i takes O(n log g i ) O(n2 ) time. Since there are at most dlog log he rounds, the total cost of Chan s algorithm is P dlog log he i=1 O(n2 ) O(n log h) Next we show how to ....
B. Chazelle and D. P. Dobkin. Intersection of convex objects in 2 and 3 dimensions. Journal of the ACM, 34:1-27, 1987.
In-Place Planar Convex Hull Algorithms - Brönnimann, Iacono, Katajainen.. (Correct)
....In the case where the largest polar angle is not unique, ties are broken by taking the farthest vertex from the previously found vertex. Finding a tangent to an individual convex hull can be done in O(log g i ) time if the vertices of the convex hull are stored in an array in clockwise order [5,29]. There are n=g i tangent nding operations per iteration and g i iterations in round i. Therefore, round i takes O(n log g i ) O(n2 ) time. Since there are at most dlog log he rounds, the total cost of Chan s algorithm is P dlog log he i=1 O(n2 ) O(n log h) Next we show how to ....
B. Chazelle and D. P. Dobkin. Intersection of convex objects in 2 and 3 dimensions. Journal of the ACM, 34:1-27, 1987.
Space-Efficient Planar Convex Hull Algorithms - Brönnimann, Iacono.. (Correct)
No context found.
B. Chazelle and D. P. Dobkin. Intersection of convex objects in 2 and 3 dimensions. Journal of the ACM, 34:1-27, 1987.
In-Place Planar Convex Hull Algorithms - Brönnimann, Iacono, Katajainen.. (Correct)
No context found.
B. Chazelle and D. P. Dobkin. Intersection of convex objects in 2 and 3 dimensions. Journal of the ACM, 34:1-27, 1987.
Space-Efficient Planar Convex Hull Algorithms - Brönnimann, Iacono.. (Correct)
No context found.
B. Chazelle, D. P. Dobkin, Intersection of convex objects in 2 and 3 dimensions, Journal of the ACM 34 (1987) 1--27.
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