{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:26:11Z","timestamp":1747189571816,"version":"3.40.5"},"reference-count":0,"publisher":"World Scientific Pub Co Pte Ltd","funder":[{"name":"SERB MATRICS","award":["MTR\/2017\/000474"],"award-info":[{"award-number":["MTR\/2017\/000474"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"abstract":"<jats:p> Given a set [Formula: see text] of [Formula: see text] pairwise disjoint convex polygonal obstacles in the plane, defined with [Formula: see text] vertices, we preprocess [Formula: see text] and compute one routing table at each vertex in a subset of vertices of [Formula: see text]. For routing a packet from any vertex [Formula: see text] to any vertex [Formula: see text], our scheme computes a routing path with a multiplicative stretch [Formula: see text] and an additive stretch [Formula: see text], by consulting routing tables at only a subset of vertices along that path. Here, [Formula: see text] is the number of obstacles of [Formula: see text] the routing path intersects, and [Formula: see text] depends on the geometry of obstacles in [Formula: see text]. During the preprocessing phase, we construct routing tables of size [Formula: see text] in [Formula: see text] time, where [Formula: see text] is an input parameter. <\/jats:p>","DOI":"10.1142\/s0129054123410034","type":"journal-article","created":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T01:45:10Z","timestamp":1682387110000},"page":"1-17","source":"Crossref","is-referenced-by-count":0,"title":["Routing Among Convex Polygonal Obstacles in the Plane"],"prefix":"10.1142","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7141-0977","authenticated-orcid":false,"given":"R.","family":"Inkulu","sequence":"first","affiliation":[{"name":"Department of Computer Science and Enginnering, IIT Guwahati, India"}]},{"given":"Pawan","family":"Kumar","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Enginnering, IIT Guwahati, India"}]}],"member":"219","published-online":{"date-parts":[[2023,4,21]]},"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054123410034","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T01:45:15Z","timestamp":1682387115000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054123410034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,21]]},"references-count":0,"alternative-id":["10.1142\/S0129054123410034"],"URL":"https:\/\/doi.org\/10.1142\/s0129054123410034","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2023,4,21]]}}}