---
res:
bibo_abstract:
- '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 R3? 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, that is,
an essential curve in the boundary of X bounding a disk in S3 \ X with length
bounded by a computable function of the number of tetrahedra of X.@eng'
bibo_authorlist:
- foaf_Person:
foaf_givenName: Jiří
foaf_name: Matoušek, Jiří
foaf_surname: Matoušek
- foaf_Person:
foaf_givenName: Eric
foaf_name: Sedgwick, Eric
foaf_surname: Sedgwick
- foaf_Person:
foaf_givenName: Martin
foaf_name: Tancer, Martin
foaf_surname: Tancer
foaf_workInfoHomepage: http://www.librecat.org/personId=38AC689C-F248-11E8-B48F-1D18A9856A87
orcid: 0000-0002-1191-6714
- foaf_Person:
foaf_givenName: Uli
foaf_name: Wagner, Uli
foaf_surname: Wagner
foaf_workInfoHomepage: http://www.librecat.org/personId=36690CA2-F248-11E8-B48F-1D18A9856A87
orcid: 0000-0002-1494-0568
bibo_doi: 10.1145/3078632
bibo_issue: '1'
bibo_volume: 65
dct_date: 2018^xs_gYear
dct_identifier:
- UT:000425685900006
dct_language: eng
dct_publisher: ACM@
dct_title: Embeddability in the 3-Sphere is decidable@
...