{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T09:11:15Z","timestamp":1787389875248,"version":"build-2736575974"},"reference-count":31,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1988,2]]},"abstract":"<jats:p>Given a simple n-vertex polygon, the triangulation problem is to partition the interior of the polygon into $n - 2$ triangles by adding $n - 3$ nonintersecting diagonals. We propose an $O(n\\log \\log n)$-time algorithm for this problem, improving on the previously best bound of $O(n\\log n)$ and showing that triangulation is not as hard as sorting. Improved algorithms for several other computational geometry problems, including testing whether a polygon is simple, follow from our result.<\/jats:p>","DOI":"10.1137\/0217010","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:30:13Z","timestamp":1109226613000},"page":"143-178","source":"Crossref","is-referenced-by-count":117,"title":["An $O(n\\log \\log n)$-Time Algorithm for Triangulating a Simple Polygon"],"prefix":"10.1137","volume":"17","author":[{"given":"Robert E.","family":"Tarjan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christopher J.","family":"Van Wyk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","unstructured":"B. K. Bhattacharya, G. T. Toussaint,  A linear algorithm for determining the translation separability of two simple polygons, Technical report, SOCS 861, School of Computer Science, McGill University, Montreal, Canada,  1986"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1137\/0209045"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.58"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"B. Chazelle,  Intersecting is easier than sorting,  Proc. Sixteenth Annual ACM Symp. on Theory of Comput.,  1984,  125\u2013134","DOI":"10.1145\/800057.808674"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1145\/357337.357340"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"W.P. Chin, S. Ntafos,  Optimum watchman routes,  Proc. Second Annual Symp. on Computational Geometry,  1986,  24\u201333","DOI":"10.1145\/10515.10518"},{"key":"R7","unstructured":"D. P. Dobkin, D. L. Souvaine, C. J. Van Wyk,  Decomposition and intersection of simple spline-gons, Algorithmica, to appear"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1137\/0215023"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1145\/357337.357341"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90062-5"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840360"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"Leo J. Guibas, Edward M. McCreight, Michael F. Plass, Janet R. Roberts,  A new representation for linear lists,  Conference Record of the Ninth Annual ACM Symposium on Theory of Computing (Boulder, Colo., 1977), Assoc. Comput. Mach., New York,  1977,  49\u201360 57:4707","DOI":"10.1145\/800105.803395"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-12689-9_105"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80033-X"},{"key":"R15","unstructured":"S. Huddleston,  An efficient scheme for fast local updates in linear lists, Dept. of Information and Computer Science, University of California, Irvine, CA,  1981"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288968"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1137\/0214056"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"S. R. Kosaraju,  Localized search in sorted lists,  Proc. Thirteenth Annual ACM Symp. on Theory of Comput.,  1981,  62\u201369","DOI":"10.1145\/800076.802458"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90101-0"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69672-5"},{"key":"R21","volume-title":"Topology: a first course","author":"Munkres James R.","year":"1975"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(87)90028-9"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3835"},{"key":"R24","unstructured":"D. L. Souvaine, Masters Thesis,  Computational Geometry in a Curved World, Ph.D. dissertation, Department of Computer Science, Princeton University,  1986 0696.68101"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1137\/0606031"},{"key":"R27","doi-asserted-by":"crossref","unstructured":"R. E. Tarjan, C. J. Van Wyk,  A linear-time algorithm for triangulating simple polygons,  Proc. Eighteenth Annual ACM Symp. on Theory of Comput.,  1986,  380\u2013388","DOI":"10.1145\/12130.12170"},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-13345-3_44"},{"key":"R29","unstructured":"A. K. Tsakalidis,  An optimal implementation for localized search, A84\/06, Fachbereich Angewandte Mathematik and Informatik, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, West Germany,  1984"},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1016\/0734-189X(84)90202-0"},{"key":"R31","first-page":"60","volume":"4","author":"Woo T. C.","year":"1985","journal-title":"ACM Trans. on Graphics"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0217010","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:44:04Z","timestamp":1787337844000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0217010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,2]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,2]]}},"alternative-id":["10.1137\/0217010"],"URL":"https:\/\/doi.org\/10.1137\/0217010","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,2]]}}}