{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T11:39:45Z","timestamp":1649158785958},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"02n03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1992,9]]},"abstract":"<jats:p> 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 \u00d7 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 \u0398( log n) time. We also show that detecting whether two convex n-gons are separable takes O(1) time. <\/jats:p>","DOI":"10.1142\/s0129626492000386","type":"journal-article","created":{"date-parts":[[2004,11,23]],"date-time":"2004-11-23T03:29:30Z","timestamp":1101180570000},"page":"249-256","source":"Crossref","is-referenced-by-count":13,"title":["CONVEX POLYGON PROBLEMS ON MESHES WITH MULTIPLE BROADCASTING"],"prefix":"10.1142","volume":"02","author":[{"given":"D.","family":"BHAGAVATHI","sequence":"first","affiliation":[{"name":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"OLARIU","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. L.","family":"SCHWING","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"ZHANG","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626492000386","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:25:03Z","timestamp":1565108703000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626492000386"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":0,"journal-issue":{"issue":"02n03","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1992,9]]}},"alternative-id":["10.1142\/S0129626492000386"],"URL":"https:\/\/doi.org\/10.1142\/s0129626492000386","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}