AbstractA surface-knot is an embedded closed connected oriented surface in 4-space. A surface diagram is a projection of a surface-knot into 3-space with crossing information. In this paper we define a distance from a special surface diagram to a trivial diagram as the minimal number of special double cycles, where we can change the crossing information to obtain the trivial diagram. We estimate the distance using the number of 1-handles needed to obtain a trivial diagram
AbstractWe present the first polynomial-time algorithm for computing the Fréchet distance for a non-...
ABSTRACT. In this paper we will consider the number of minimal surfaces which do not touch all of a ...
We present an efficient and robust approach for computing the minimum distance between two sphere-sw...
We study surface knots in 4–space by using generic planar projections. These projections have fold p...
Abstract. We calculate the bridge distance for m-bridge knots/links in the 3-sphere with sufficientl...
Analogous to a classical knot diagram, a surface-link can be generically projected to 3-space and gi...
AbstractLet Γ be a graph or hypergraph drawn on a connected surface which is not a sphere, in such a...
Abstract. The triple point number of a surface-knot is defined to be the minimal number of triple po...
peer reviewedWe investigate a type of distance between triangulations on finite-type surfaces where ...
The Fréchet distance is a well-studied measure for the similarity of shapes. While efficient algorit...
Abstract. The singularity set of a generic standard projection to the three space of a closed surfac...
Surface diagrams are a diagrammatic representation of smooth, 4-dimensional manifolds. In fact, a su...
Computing the Fréchet distance for surfaces is a surprisingly hard problem and the only known polyno...
We present the first polynomial-time algorithm for computing the Fréchet distance for a non-trivial ...
A suitable measure for the similarity of shapes represented by parameterized curves or surfaces is t...
AbstractWe present the first polynomial-time algorithm for computing the Fréchet distance for a non-...
ABSTRACT. In this paper we will consider the number of minimal surfaces which do not touch all of a ...
We present an efficient and robust approach for computing the minimum distance between two sphere-sw...
We study surface knots in 4–space by using generic planar projections. These projections have fold p...
Abstract. We calculate the bridge distance for m-bridge knots/links in the 3-sphere with sufficientl...
Analogous to a classical knot diagram, a surface-link can be generically projected to 3-space and gi...
AbstractLet Γ be a graph or hypergraph drawn on a connected surface which is not a sphere, in such a...
Abstract. The triple point number of a surface-knot is defined to be the minimal number of triple po...
peer reviewedWe investigate a type of distance between triangulations on finite-type surfaces where ...
The Fréchet distance is a well-studied measure for the similarity of shapes. While efficient algorit...
Abstract. The singularity set of a generic standard projection to the three space of a closed surfac...
Surface diagrams are a diagrammatic representation of smooth, 4-dimensional manifolds. In fact, a su...
Computing the Fréchet distance for surfaces is a surprisingly hard problem and the only known polyno...
We present the first polynomial-time algorithm for computing the Fréchet distance for a non-trivial ...
A suitable measure for the similarity of shapes represented by parameterized curves or surfaces is t...
AbstractWe present the first polynomial-time algorithm for computing the Fréchet distance for a non-...
ABSTRACT. In this paper we will consider the number of minimal surfaces which do not touch all of a ...
We present an efficient and robust approach for computing the minimum distance between two sphere-sw...