{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:24:52Z","timestamp":1725495892869},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540654735"},{"type":"electronic","value":"9783540376231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-37623-2_6","type":"book-chapter","created":{"date-parts":[[2007,11,19]],"date-time":"2007-11-19T12:45:17Z","timestamp":1195476317000},"page":"72-86","source":"Crossref","is-referenced-by-count":12,"title":["Upward Planarity Checking: \u201cFaces Are More than Polygons\u201d"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Di Battista","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,1,15]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"P. Bertolazzi, G. D. Battista, and W. Didimo. Quasi upward planarity. Manuscript, 1998.","DOI":"10.1007\/3-540-37623-2_2"},{"issue":"12","key":"6_CR2","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/BF01188716","volume":"6","author":"P. Bertolazzi","year":"1994","unstructured":"P. Bertolazzi, G. Di Battista, G. Liotta, and C. Mannino. Upward drawings of triconnected digraphs. Algorithmica, 6(12):476\u2013497, 1994.","journal-title":"Algorithmica"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B. Chazelle","year":"1991","unstructured":"B. Chazelle. Triangulating a simple polygon in linear time. Discrete Comput. Geom., 6:485\u2013524, 1991.","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/357337.357340","volume":"3","author":"B. Chazelle","year":"1984","unstructured":"B. Chazelle and J. Incerpi. Triangulation and shape-complexity. ACM Trans. Graph., 3(2):135\u2013152, 1984.","journal-title":"ACM Trans. Graph."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"O. Devillers, G. Liotta, R. Tamassia, and F. Preparata. Cecking the convexity of polytopes and the planarity of subdivisions. In Algorithms and Data Structures (Proc. WADS 97), volume 1272 of Lecture Notes Comput. Sci., pages 186\u2013199. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63307-3_59"},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235\u2013282, 1994.","journal-title":"Comput. Geom. Theory Appl."},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G. Battista Di","year":"1988","unstructured":"G. Di Battista and R. Tamassia. Algorithms for plane representations of acyclic digraphs. Theoret. Comput. Sci., 61:175\u2013198, 1988.","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF02263430","volume":"31","author":"H. ElGindy","year":"1983","unstructured":"H. ElGindy, D. Avis, and G. T. Toussaint. Applications of a two-dimensional hidden-line algorithm to other geometric problems. Computing, 31:191\u2013202, 1983.","journal-title":"Computing"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.2307\/2412323","volume":"18","author":"K. R. Gabriel","year":"1969","unstructured":"K. R. Gabriel and R. R. Sokal. A new statistical approach to geographic variation analysis. Systematic Zoology, 18:259\u2013278, 1969.","journal-title":"Systematic Zoology"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(78)90062-5","volume":"7","author":"M. R. Garey","year":"1978","unstructured":"M. R. Garey, D. S. Johnson, F. P. Preparata, and R. E. Tarjan. Triangulating a simple polygon. Inform. Process. Lett., 7:175\u2013179, 1978.","journal-title":"Inform. Process. Lett."},{"key":"6_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0067364","volume-title":"Graph Theory.","author":"F. Harary","year":"1972","unstructured":"F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1972."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"S. Hertel and K. Mehlhorn. Fast triangulation of simple polygons. In Proc. 4th Internat. Conf. Found. Comput. Theory, volume 158 of Lecture Notes Comput. Sci., pages 207\u2013218. Springer-Verlag, 1983.","DOI":"10.1007\/3-540-12689-9_105"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0012-365X(87)90008-2","volume":"63","author":"D. Kelly","year":"1987","unstructured":"D. Kelly. Fundamentals of planar ordered sets. Discrete Math., 63:197\u2013216, 1987.","journal-title":"Discrete Math."},{"key":"6_CR14","unstructured":"G. Liotta, F. P. Preparata, and R. Tamassia. Robust proximity queries: an illustration of degree-driven algorithm design. SIAM J. Comput. to appear."},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"G. Liotta, F. P. Preparata, and R. Tamassia. Robust proximity queries: an illustration of degree-driven algorithm design. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 156\u2013165, 1997.","DOI":"10.1145\/262839.262922"},{"key":"6_CR16","unstructured":"K. Mehlhorn and S. N\u00e4her. Checking Geometric Structures, Dec. 1996. Manual."},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn, S. N\u00e4her, T. Schilz, S. Schirra, M. Seel, R. Seidel, and C. Uhrig. Checking geometric programs or verification of geometric structures. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 159\u2013165, 1996.","DOI":"10.1145\/237218.237344"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn, S. N\u00e4her, T. Schilz, S. Schirra, M. Seel, R. Seidel, and C. Uhrig. Checking geometric programs or verification of geometric structures. Manuscript, 1997.","DOI":"10.1145\/237218.237344"},{"key":"6_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985."},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/BF01905693","volume":"7","author":"G. Toussaint","year":"1991","unstructured":"G. Toussaint. Efficient triangulation of simple polygons. Visual Comput., 7:280\u2013295, 1991.","journal-title":"Visual Comput."},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"G. T. Toussaint","year":"1980","unstructured":"G. T. Toussaint. The relative neighbourhood graph of a finite planar set. Pattern Recogn., 12:261\u2013268, 1980.","journal-title":"Pattern Recogn."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-37623-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T19:20:29Z","timestamp":1556997629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-37623-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540654735","9783540376231"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-37623-2_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}