Related papers: Analysis of a method to parameterize planar curves…
To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an…
Conformal geodesics are distinguished curves on a conformal manifold, loosely analogous to geodesics of Riemannian geometry. One definition of them is as solutions to a third order differential equation determined by the conformal…
We show that the minimization problem of any non-convex and non-lower semi-continuous function on a compact convex subset of a locally convex real topological vector space can be studied via an associated convex and lower semi-continuous…
Due to their flexibility, frames of Hilbert spaces are attractive alternatives to bases in approximation schemes for problems where identifying a basis is not straightforward or even feasible. Computing a best approximation using frames,…
Combining the techniques of approximation algorithms and parameterized complexity has long been considered a promising research area, but relatively few results are currently known. In this paper we study the parameterized approximability…
The Circle Packing Theorem states that every planar graph can be represented as the tangency graph of a family of internally-disjoint circles. A well-known generalization is the Primal-Dual Circle Packing Theorem for 3-connected planar…
Let $\Sigma$ be a surface with boundary $b(\Sigma)$, $\mathcal{L}$ be a collection of $k$ disjoint $b(\Sigma)$-paths in $\Sigma$, and $P$ be a non-separating $b(\Sigma)$-path in $\Sigma$. We prove that there is a homeomorphism $\phi: \Sigma…
We study straight-line drawings of planar graphs with prescribed face areas. A plane graph is 'area-universal' if for every area assignment on the inner faces, there exists a straight-line drawing realizing the prescribed areas. For…
Computing planar orthogonal drawings with the minimum number of bends is one of the most relevant topics in Graph Drawing. The problem is known to be NP-hard, even when we want to test the existence of a rectilinear planar drawing, i.e., an…
We extend the notion of triangle to "imaginary triangles" with complex valued sides and angles, and parametrize families of such triangles by plane algebraic curves. We study in detail families of triangles with two commensurable angles,…
Let G be an amenable group, let X be a Banach space and let \pi : G --> B(X) be a bounded representation. We show that if the set {\pi(t) : t \in G} is gamma-bounded then \pi extends to a bounded homomorphism w : C*(G) --> B(X) on the group…
For some $g \geq 3$, let $\Gamma$ be a finite index subgroup of the mapping class group of a genus $g$ surface (possibly with boundary components and punctures). An old conjecture of Ivanov says that the abelianization of $\Gamma$ should be…
This article investigates the approximation quality achievable for biobjective minimization problems with respect to the Pareto cone by solutions that are (approximately) optimal with respect to larger ordering cones. When simultaneously…
A topological constraint on the possible values of the universal quantization parameter is revealed in the case of geometric quantization on (boundary) curves diffeomorphic to $S^1$, analytically extended on a bounded domain in…
The symmetric $C^0$ interior penalty method is one of the most popular discontinuous Galerkin methods for the biharmonic equation. This paper introduces an automatic local selection of the involved stability parameter in terms of the…
We study the Dirichlet problem for a graph $\Sigma$ in $\mathbb{R}^{n+1}$ with normalized constant mean curvature $H>0$ and planar boundary $\Gamma=\partial \Omega$. Our main result is that the optimal solvability condition, namely that the…
We prove that compact 3-manifolds $M$ of constant curvature +1 with boundary a minimal surface are locally naturally parametrized by the conformal class of the boundary metric $\gamma$ in the Teichmuller space of $\partial M$, when…
Problems that require the parameterization of closed contours arise frequently in computer vision applications. This article introduces a new curve parameterization algorithm that is able to fit a closed curve to a set of points while being…
We introduce a unified framework based on bi-level optimization schemes to deal with parameter learning in the context of image processing. The goal is to identify the optimal regularizer within a family depending on a parameter in a…
We propose a novel method for parameterizations of triangle meshes by finding an optimal quasiconformal map that minimizes an energy consisting of a relative entropy term and a quasiconformal term. By prescribing a prior probability measure…