{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T10:34:37Z","timestamp":1769078077001,"version":"3.49.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,3,27]],"date-time":"2018-03-27T00:00:00Z","timestamp":1522108800000},"content-version":"vor","delay-in-days":5625,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0925-7721(01)00069-4","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T15:00:31Z","timestamp":1034262031000},"page":"303-312","source":"Crossref","is-referenced-by-count":78,"title":["On embedding an outer-planar graph in a point set"],"prefix":"10.1016","volume":"23","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(01)00069-4_BIB001","series-title":"Graph Drawing (Proc. GD'94)","first-page":"340","article-title":"Proximity constraints and representable trees","volume":"894","author":"Bose","year":"1995"},{"key":"10.1016\/S0925-7721(01)00069-4_BIB002","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02086609","article-title":"Characterizing proximity trees","volume":"16","author":"Bose","year":"1996","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(01)00069-4_BIB003","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0925-7721(01)00069-4_BIB004","unstructured":"P. Bose, M. McAllister, J. Snoeyink, Optimal algorithms to embed trees in a point set, J. Graph Algorithms Appl., to appear. Also appears in: Proc. Graph Drawing GD'95, in: Lecture Notes in Computer Science, Vol. 1027, 1995, pp. 64\u201375"},{"key":"10.1016\/S0925-7721(01)00069-4_BIB005","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/TIT.1985.1057060","article-title":"On the convex layers of a planar set","volume":"IT-31","author":"Chazelle","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0925-7721(01)00069-4_BIB006","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0925-7721(01)00069-4_BIB007","series-title":"Graph Drawing (Proc. GD'94)","first-page":"307","article-title":"Optimal-area upward drawings of AVL trees","volume":"894","author":"Crescenzi","year":"1995"},{"key":"10.1016\/S0925-7721(01)00069-4_BIB008","series-title":"Proc. Eighth Canadian Conf. on Comp. Geom.","first-page":"312","article-title":"Straight line embeddings of planar graphs on point sets","author":"Casta\u00f1eda","year":"1996"},{"key":"10.1016\/S0925-7721(01)00069-4_BIB009","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","article-title":"Algorithms for drawing graphs: an annotated bibliography","volume":"4","author":"Di Battista","year":"1994","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(01)00069-4_BIB010","series-title":"Proc. 10th Annu. ACM Sympos. Comput. Geom.","first-page":"49","article-title":"The realization problem for Euclidean minimum spanning trees is NP-hard","author":"Eades","year":"1994"},{"key":"10.1016\/S0925-7721(01)00069-4_BIB011","first-page":"229","article-title":"On straight line representation of planar graphs","volume":"11","author":"Fary","year":"1948","journal-title":"Acta Sci. Math. Szeged"},{"key":"10.1016\/S0925-7721(01)00069-4_BIB012","doi-asserted-by":"crossref","first-page":"165","DOI":"10.2307\/2323956","article-title":"Embedding a planar triangulation with vertices at specified points (solution to problem e3341)","volume":"98","author":"Gritzmann","year":"1991","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0925-7721(01)00069-4_BIB013","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01994880","article-title":"Applications of a semi-dynamic convex hull algorithm","volume":"32","author":"Hershberger","year":"1992","journal-title":"BIT"},{"key":"10.1016\/S0925-7721(01)00069-4_BIB014","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF02573994","article-title":"The rooted tree embedding problem into points in the plane","volume":"11","author":"Ikebe","year":"1994","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(01)00069-4_BIB015","series-title":"Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada","first-page":"192","article-title":"Area requirement of visibility representations of trees","author":"Kant","year":"1993"},{"key":"10.1016\/S0925-7721(01)00069-4_BIB016","first-page":"159","article-title":"Fast detection and display of symmetry in trees","volume":"64","author":"Manning","year":"1988","journal-title":"Congressus Numerantium"},{"key":"10.1016\/S0925-7721(01)00069-4_BIB017","series-title":"Proc. 7th Annu. ACM Sympos. Comput. Geom.","first-page":"239","article-title":"Transitions in geometric minimum spanning trees","author":"Monma","year":"1991"},{"key":"10.1016\/S0925-7721(01)00069-4_BIB018","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","article-title":"Maintenance of configurations in the plane","volume":"23","author":"Overmars","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0925-7721(01)00069-4_BIB019","series-title":"Planar Graphs","first-page":"131","article-title":"Layout of rooted trees","volume":"9","author":"Pach","year":"1993"},{"key":"10.1016\/S0925-7721(01)00069-4_BIB020","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000694?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000694?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:56:22Z","timestamp":1556819782000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772101000694"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0925772101000694"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(01)00069-4","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}