{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:11Z","timestamp":1725664091086},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540589501"},{"type":"electronic","value":"9783540491552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-58950-3_366","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:54:49Z","timestamp":1330275289000},"page":"147-158","source":"Crossref","is-referenced-by-count":8,"title":["Visibility graphs and oriented matroids (extended abstract)"],"prefix":"10.1007","author":[{"given":"James","family":"Abello","sequence":"first","affiliation":[]},{"given":"Krishna","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"16_CR1","first-page":"27","volume":"3","author":"J. Abello","year":"1993","unstructured":"J. Abello, O. Egecioglu, Visibility Graphs of Staircase Polygons with Uniform Step Length, International Journal of Discrete and Computational Geometry, 3 (1993) pp. 27\u201337.","journal-title":"International Journal of Discrete and Computational Geometry"},{"key":"16_CR2","first-page":"119","volume":"90","author":"J. Abello","year":"1992","unstructured":"J. Abello, L. Hua, C. Pisupati, On Visibility Graphs of Simple Polygons, Congressus Numerantium, 90 (1992), pp. 119\u2013128.","journal-title":"Congressus Numerantium"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"J.Abello, O.Egecioglu, K.Kumar, Visibility Graphs of Staircase Polygons and the Weak Bruhat Order I: From Visibility Graphs to Maximal Chains, Discrete and Computational Geometry, Accepted (pending revisions).","DOI":"10.1007\/BF02570710"},{"key":"16_CR4","unstructured":"J.Abello, K.Kumar, Visibility Graphs and Oriented Matroids (Long Version), Manuscript."},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01553882","volume":"4","author":"B. Aronov","year":"1989","unstructured":"B. Aronov, On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon, Algorithmica, 4 (1989) pp. 109\u2013140.","journal-title":"Algorithmica"},{"key":"16_CR6","volume-title":"Lecture Notes in Mathematics, 1335","author":"J. Bokowski","year":"1989","unstructured":"J. Bokowski, B. Sturmfels, Computational Synthetic Geometry, Lecture Notes in Mathematics, 1335 (1989), Springer-Verlag, New York."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"J. Canny, Some Algebraic and Geometric Computations in PSPACE, Proceedings of the 20th ACM Symposium on Theory of Computing, 1988, pp. 460\u2013467.","DOI":"10.1145\/62212.62257"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"C. Coullard and A. Lubiw, Distance Visibility Graphs, Proceedings of the ACM Symposium on Computational Geometry, 1991, pp. 290\u2013302.","DOI":"10.1145\/109648.109681"},{"key":"16_CR9","unstructured":"H. Everett, Visibility Graph Recognition, PhD Dissertation, Department of Computer Science, University of Toronto, 1990."},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0095-8956(78)90039-4","volume":"25","author":"J. Folkman","year":"1978","unstructured":"J. Folkman, J. Lawrence, Oriented Matroids, Journal of Combinatorial Theory (B), 25 (1978), pp. 199\u2013236.","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"16_CR11","first-page":"132","volume-title":"Lecture Notes in Computer Science, 318","author":"S.K. Ghosh","year":"1988","unstructured":"S.K. Ghosh, On Recognizing and Characterizing Visibility Graphs of Simple Polygons, Lecture Notes in Computer Science, 318 (1988), pp. 132\u2013139, Springer-Verlag, New York."},{"key":"16_CR12","first-page":"84","volume":"(37)","author":"J.E. Goodman","year":"1984","unstructured":"J.E. Goodman, R. Pollack, \u201cSemispaces of Configurations, Cell Complexes of Arrangements,\u201d Journal of Combinatorial Theory (A), (37) pp. 84\u2013102, 1984.","journal-title":"Journal of Combinatorial Theory (A)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"N. Greene, M. Kass, and G. Miller, Hierarchical Z-buffer Visibility, SIGGRAPH 93 Proceedings, pp 231\u2013238, 1993.","DOI":"10.1145\/166117.166147"},{"key":"16_CR14","unstructured":"K. Kumar, Combinatorial Aspects of Point Visibility, PhD. Dissertation, Dept.. of Computer Science, Texas A&M University, August 1993."},{"key":"16_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0024-3795(82)90094-5","volume":"48","author":"J. Lawrence","year":"1982","unstructured":"J. Lawrence, Oriented Matroids and Multiply Ordered Sets, Linear Algebra and its Applications, 48 (1982) pp. 1\u201312.","journal-title":"Linear Algebra and its Applications"},{"key":"16_CR16","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","volume":"(22)","author":"T. Lozano-Perez","year":"1979","unstructured":"T. Lozano-Perez and M. A. Wesley \u201cAn Algorithm for Planning Collision-Free Paths among Polyhedral Obstacles,\u201d Communications of the ACM, (22) pp. 560\u2013570, 1979.","journal-title":"Communications of the ACM"},{"key":"16_CR17","first-page":"527","volume-title":"Lecture Notes in Mathematics, 1346","author":"N.E. Mn\u00ebv","year":"1988","unstructured":"N.E. Mn\u00ebv, The Universality Theorems on the Classification Problem of Configuration Varieties and Convex Polytope Varieties, Lecture Notes in Mathematics, 1346 (1988), pp. 527\u2013544, Springer-Verlag, New York."},{"key":"16_CR18","unstructured":"J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, 1987."},{"key":"16_CR19","unstructured":"J. O'Rourke, The Computational Geometry Column, SIGACT News, (1992)."},{"key":"16_CR20","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1090\/dimacs\/004\/41","volume":"4","author":"P.W. Shor","year":"1991","unstructured":"P.W. Shor, Stretchability of Pseudolines is NP-Hard, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 4 (1991), pp. 531\u2013554.","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"S. Teller, P. Hanrahan, Global Visibility Algorithms for Illumination Computations, SIGGRAPH 93 Proceedings, pp 239\u2013246, 1993.","DOI":"10.1145\/166117.166148"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58950-3_366.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:24:49Z","timestamp":1605648289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58950-3_366"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540589501","9783540491552"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-58950-3_366","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}