{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:45:40Z","timestamp":1725551140322},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633075"},{"type":"electronic","value":"9783540694229"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63307-3_59","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T19:22:48Z","timestamp":1270495368000},"page":"186-199","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Checking the convexity of polytopes and the planarity of subdivisions (extended abstract)"],"prefix":"10.1007","author":[{"given":"O.","family":"Devillers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F. P.","family":"Preparata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Tamassia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,30]]},"reference":[{"key":"17_CR1","unstructured":"N. Amenta. Directory of computational geometry software. http:\/\/www.geom.umn.edu\/software\/cglist\/."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"G. Barequet, S. S. Bridgeman, C. A. Duncan, M. T. Goodrich, and R. Tamassia Classic computational geometry with GeomNet. In Proc. ACM Symp. Computational Geometry, 1997.","DOI":"10.1145\/262839.263035"},{"key":"17_CR3","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"C-28","author":"J. L. Bentley","year":"1979","unstructured":"J. L. Bentley and T. A. Ottmann. Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput., C-28:643\u2013647, 1979.","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"17_CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1145\/200836.200880","volume":"42","author":"M. Blum","year":"Jan. 1995","unstructured":"M. Blum and S. Kannan. Designing programs that check their work. J. ACM, 42(1):269\u2013291, Jan. 1995.","journal-title":"J. ACM"},{"key":"17_CR5","unstructured":"C. Burnikel. Exact Computation of Voronoi Diagrams and Line Segment Intersections. Ph.D thesis, Universitat des Saarlandes, Mar. 1996."},{"key":"17_CR6","doi-asserted-by":"crossref","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."},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"G. Di Battista, R. Tamassia, and L. Vismara. On-line convex planarity testing. In Graph-Theoretic Concepts in Computer Science (Proc. WG 94), Lecture Notes in Computer Science. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-59071-4_52"},{"key":"17_CR8","unstructured":"G. Di Battista, R. Tamassia, and L. Vismara. On-line convex planarity testing. Technical Report CS-95-26, Dept. Computer Science, Brown Univ., 1995. ftp:\/\/ftp.cs.brown.edu\/pub\/techreports\/95\/cs95-26.ps.Z."},{"issue":"3","key":"17_CR9","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1137\/S0895480194264010","volume":"9","author":"G. Battista Di","year":"1996","unstructured":"G. Di Battista and L. Vismara. Angles of planar triangular graphs. SIAM J. Discrete Math., 9(3):349\u2013359, 1996.","journal-title":"SIAM J. Discrete Math."},{"key":"17_CR10","first-page":"229","volume":"11","author":"I. Fary","year":"1948","unstructured":"I. Fary. On straight lines representation of planar graphs. Acta Sci. Math. Szeged., 11:229\u2013233, 1948.","journal-title":"Acta Sci. Math. Szeged."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"S. Gottschalk, M. C. Lin, and D. Manocha. OBB-tree: A hierarchical structure for rapid interference detection. Comput. Graph., 1996. Proc. SIGGRAPH '96.","DOI":"10.1145\/237170.237244"},{"key":"17_CR12","volume-title":"Graph Theory","author":"F. Harary","year":"1972","unstructured":"F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1972."},{"issue":"4","key":"17_CR13","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"J. Hopcroft and R. E. Tarjan. Efficient planarity testing. J. ACM, 21(4):549\u2013568, 1974.","journal-title":"J. ACM"},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF02187912","volume":"3","author":"D. G. Kirkpatrick","year":"1988","unstructured":"D. G. Kirkpatrick. Establishing order in planar subdivisions. Discrete Comput. Geom., 3:267\u2013280, 1988.","journal-title":"Discrete Comput. Geom."},{"key":"17_CR15","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01840358","volume":"2","author":"C. Levcopoulos","year":"1987","unstructured":"C. Levcopoulos and A. Lingas. On approximation behavior of the greedy triangulation for convex polygons. Algorithmica, 2:175\u2013193, 1987.","journal-title":"Algorithmica"},{"key":"17_CR16","unstructured":"G. Liotta, F. P. Preparata, and R. Tamassia. Robust proximity queries: an illustration of degree-driven algorithm design. SIAM J. Computing. to appear."},{"key":"17_CR17","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. ACM Symp. Computational Geometry, 1997.","DOI":"10.1145\/262839.262922"},{"key":"17_CR18","unstructured":"K. Mehlhorn and S. N\u00e4her. Checking Geometric Structures, December 1996. Manual."},{"key":"17_CR19","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":"17_CR20","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"},{"issue":"7","key":"17_CR21","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1109\/12.392843","volume":"44","author":"G. F. Sullivan","year":"1995","unstructured":"G. F. Sullivan, D. S. Wilson, and G. M. Masson. Certification of computational results. IEEE Transactions on Computers, 44(7):833\u2013847, 1995.","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63307-3_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:45:00Z","timestamp":1558269900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63307-3_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633075","9783540694229"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-63307-3_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"30 July 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}