CONVEX POLYGON PROBLEMS ON MESHES WITH MULTIPLE BROADCASTING
1992 ◽
Vol 02
(02n03)
◽
pp. 249-256
◽
We propose time-optimal algorithms for a number of convex polygon problems on meshes with multiple broadcasting. Specifically, we show that on a mesh with multiple broadcasting of size n × n, the task of deciding whether an n-gon is convex, deciding whether two convex n-gons edge-intersect, deciding whether one convex n-gon lies in the interior of another, as well as variants of the tasks of computing the intersection and union of two convex n-gons can be accomplished in Θ( log n) time. We also show that detecting whether two convex n-gons are separable takes O(1) time.
1994 ◽
Vol 2
(3)
◽
pp. 247-251
◽
Keyword(s):
2002 ◽
Vol 12
(03n04)
◽
pp. 365-374
◽
Keyword(s):
1996 ◽
Vol 8
(3-4)
◽
pp. 271-283
◽
2017 ◽
Vol 53
(3)
◽
pp. 203-209
◽
1987 ◽
Vol 35
(3)
◽
pp. 359-362
◽
1996 ◽
Vol 25
(6)
◽
pp. 1196-1230
◽
2008 ◽
Vol 44
(10)
◽
pp. 154
◽