{"language":[{"iso":"eng"}],"doi":"10.1145/2582112.2582137","conference":{"end_date":"2014-06-11","location":"Kyoto, Japan","name":"SoCG: Symposium on Computational Geometry","start_date":"2014-06-08"},"title":"Embeddability in the 3 sphere is decidable","department":[{"_id":"UlWa"}],"author":[{"full_name":"Matoušek, Jiří","last_name":"Matoušek","first_name":"Jiří"},{"full_name":"Sedgwick, Eric","last_name":"Sedgwick","first_name":"Eric"},{"first_name":"Martin","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","full_name":"Tancer, Martin","orcid":"0000-0002-1191-6714","last_name":"Tancer"},{"orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","last_name":"Wagner","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"01","month":"06","publisher":"ACM","page":"78 - 84","abstract":[{"text":"We show that the following algorithmic problem is decidable: given a 2-dimensional simplicial complex, can it be embedded (topologically, or equivalently, piecewise linearly) in ℝ3? By a known reduction, it suffices to decide the embeddability of a given triangulated 3-manifold X into the 3-sphere S3. The main step, which allows us to simplify X and recurse, is in proving that if X can be embedded in S3, then there is also an embedding in which X has a short meridian, i.e., an essential curve in the boundary of X bounding a disk in S3 nX with length bounded by a computable function of the number of tetrahedra of X.","lang":"eng"}],"_id":"2157","oa":1,"date_created":"2018-12-11T11:56:02Z","main_file_link":[{"url":"http://arxiv.org/abs/1402.0815","open_access":"1"}],"date_published":"2014-06-01T00:00:00Z","citation":{"ista":"Matoušek J, Sedgwick E, Tancer M, Wagner U. 2014. Embeddability in the 3 sphere is decidable. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 78–84.","ama":"Matoušek J, Sedgwick E, Tancer M, Wagner U. Embeddability in the 3 sphere is decidable. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:78-84. doi:<a href=\"https://doi.org/10.1145/2582112.2582137\">10.1145/2582112.2582137</a>","mla":"Matoušek, Jiří, et al. “Embeddability in the 3 Sphere Is Decidable.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 78–84, doi:<a href=\"https://doi.org/10.1145/2582112.2582137\">10.1145/2582112.2582137</a>.","ieee":"J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Embeddability in the 3 sphere is decidable,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 78–84.","short":"J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 78–84.","chicago":"Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Embeddability in the 3 Sphere Is Decidable.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 78–84. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582137\">https://doi.org/10.1145/2582112.2582137</a>.","apa":"Matoušek, J., Sedgwick, E., Tancer, M., &#38; Wagner, U. (2014). Embeddability in the 3 sphere is decidable. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 78–84). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582137\">https://doi.org/10.1145/2582112.2582137</a>"},"type":"conference","publist_id":"4849","publication":"Proceedings of the Annual Symposium on Computational Geometry","year":"2014","acknowledgement":"ERC Advanced Grant No. 267165; Grant GRADR Eurogiga GIG/11/E023  (SNSF-PP00P2-138948); Swiss National Science Foundation  (SNSF-200020-138230).","status":"public","scopus_import":1,"date_updated":"2023-09-11T13:38:49Z","related_material":{"record":[{"id":"425","status":"public","relation":"later_version"}]},"publication_status":"published","oa_version":"Submitted Version"}