{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T15:51:40Z","timestamp":1770738700399,"version":"3.49.0"},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[1997,6]]},"abstract":"<jats:p> We consider the problem of embedding the vertices of a plane graph into a small (polynomial size) grid in the plane in such a way that the edges are straight, nonintersecting line segments and faces are convex polygons. We present a linear-time algorithm which, given an n-vertex 3-connected plane G (with n \u2265 3), finds such a straight-line convex embedding of G into a (n - 2) \u00d7 (n - 2) grid. <\/jats:p>","DOI":"10.1142\/s0218195997000144","type":"journal-article","created":{"date-parts":[[2003,10,16]],"date-time":"2003-10-16T10:47:26Z","timestamp":1066301246000},"page":"211-223","source":"Crossref","is-referenced-by-count":78,"title":["Convex Grid Drawings of 3-Connected Planar Graphs"],"prefix":"10.1142","volume":"07","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of California, Riverside, CA 92521, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goos","family":"Kant","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Utrecht University, Padualaan 14, 3584 CH Utrecht, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195997000144","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:30:56Z","timestamp":1565137856000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195997000144"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":0,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1997,6]]}},"alternative-id":["10.1142\/S0218195997000144"],"URL":"https:\/\/doi.org\/10.1142\/s0218195997000144","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}