{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T16:42:13Z","timestamp":1648572133771},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5676,"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":[[1998,1]]},"DOI":"10.1016\/s0925-7721(97)00015-1","type":"journal-article","created":{"date-parts":[[2003,4,24]],"date-time":"2003-04-24T22:53:11Z","timestamp":1051224791000},"page":"111-125","source":"Crossref","is-referenced-by-count":3,"title":["Universal 3-dimensional visibility representations for graphs"],"prefix":"10.1016","volume":"9","author":[{"given":"Helmut","family":"Alt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Godau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sue","family":"Whitesides","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(97)00015-1_BIB1","first-page":"62","article-title":"The number of polytopes, configurations and real matroids","volume":"33","author":"Alon","year":"1986","journal-title":"Mathematica"},{"key":"10.1016\/S0925-7721(97)00015-1_BIB2","series-title":"Proceedings Symposium on Graph Drawing","first-page":"8","article-title":"Universal 3-dimensional visibility representations for graphs","volume":"1027","author":"Alt","year":"1995"},{"key":"10.1016\/S0925-7721(97)00015-1_BIB3","first-page":"2","article-title":"On a visibility representation for graphs in three dimensions","volume":"Vol. 3","author":"Bose","year":"1994"},{"key":"10.1016\/S0925-7721(97)00015-1_BIB4","series-title":"Proceedings Graph Drawing, Princeton, NJ, 1994","first-page":"159","article-title":"Rectangle-visibility representations of bipartite graphs","volume":"894","author":"Dean","year":"1995"},{"issue":"5","key":"10.1016\/S0925-7721(97)00015-1_BIB5","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: Theory and Applications"},{"key":"10.1016\/S0925-7721(97)00015-1_BIB6","first-page":"463","article-title":"A combinatorial problem in geometry","volume":"2","author":"Erd\u00f6s","year":"1935","journal-title":"Compositio Math."},{"key":"10.1016\/S0925-7721(97)00015-1_BIB7","series-title":"Proceedings Symposium on Graph Drawing","first-page":"234","article-title":"New results on a visibility representation of graphs in 3D","volume":"1027","author":"Fekete","year":"1995"},{"key":"10.1016\/S0925-7721(97)00015-1_BIB8","unstructured":"S. Felsner, Personal communication, 1995."},{"key":"10.1016\/S0925-7721(97)00015-1_BIB9","doi-asserted-by":"crossref","first-page":"215","DOI":"10.2140\/pjm.1961.11.215","article-title":"On a conjecture of H. Hadwiger","volume":"11","author":"Gr\u00fcnbaum","year":"1961","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0925-7721(97)00015-1_BIB10","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/BF01899995","article-title":"\u00dcber Treffanzahlen bei translationsgleichen Eik\u00f6rpern","volume":"VIII","author":"Hadwiger","year":"1957","journal-title":"Arch. Math."},{"key":"10.1016\/S0925-7721(97)00015-1_BIB11","series-title":"Proceedings Graph Drawing, Princeton, NJ, 1994","first-page":"167","article-title":"On the number of directions in visibility representations of graphs","volume":"894","author":"Kranakis","year":"1995"},{"key":"10.1016\/S0925-7721(97)00015-1_BIB12","series-title":"Proceedings Graph Drawing, Princeton, NJ, 1994","first-page":"177","article-title":"Directed VR-representable graphs have unbounded dimension","volume":"894","author":"Romanik","year":"1995"},{"key":"10.1016\/S0925-7721(97)00015-1_BIB13","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","article-title":"A unified approach to visibility representations of planar graphs","volume":"1","author":"Tamassia","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(97)00015-1_BIB14","series-title":"Proceedings ACM Symp. on Computational Geometry","first-page":"147","article-title":"Characterizing bar line-of-sight graphs","author":"Wismath","year":"1985"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000151?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000151?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T01:55:38Z","timestamp":1556675738000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772197000151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0925772197000151"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(97)00015-1","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}