Related papers: Minimal triangulations for an infinite family of l…
Every noncompact surface is shown to have a (3,6)-tight triangulation, and applications are given to the generic rigidity of countable bar-joint frameworks in R^3. In particular, every noncompact surface has a (3,6)-tight triangulation that…
Clusters of galaxies acting as gravitational lenses deform the images of background galaxies. For small galaxies the deformation is determined by the local properties of the lens (shear, convergence). Small circular shaped galaxies are seen…
It has recently been established by Below, De Loera, and Richter-Gebert that finding a minimum size (or even just a small) triangulation of a convex polyhedron is NP-complete. Their 3SAT-reduction proof is discussed.
The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…
Discrete normal surfaces are normal surfaces whose intersection with each tetrahedron of a triangulation has at most one component. They are also natural Poincar\'e duals to 1-cocycles with $\ZZ/2\ZZ$-coefficients. For a fixed cohomology…
We introduce the notion of a minimal Lagrangian connection on the tangent bundle of a manifold and classify all such connections in the case where the manifold is a compact oriented surface of non-vanishing Euler characteristic. Combining…
We study the set of image tuples arising from fixed cameras observing varying planar 3-dimensional point configurations. We derive a formula for the number of complex critical points of the triangulation problem, which seeks to reconstruct…
In this paper we consider minimal Lagrangian submanifolds in $n$-dimensional complex space forms. More precisely, we study such submanifolds which, endowed with the induced metrics, write as a Riemannian product of two Riemannian manifolds,…
We define a triangle design as a partition of the set of lines of a projective space into triangles, where a triangle consists of three pairwise intersecting lines with no common point. A triangle design is balanced if all points are…
A family of compact n-manifolds is locally combinatorially defined (LCD) if it can be specified by a finite number of local triangulations. We show that LCD is equivalent to the existence of a compact branched n-manifold W, such that the…
We introduce the notion of the second lattice width of a lattice polytope and use this to classify lattice triangles by their width and second width. This is equivalent to classifying lattice triangles contained in a given rectangle (and no…
The inability of standard models to explain the flux ratios in many 4-image gravitational lenses has been cited as evidence for significant small-scale structure in lens galaxies. That claim has generally relied on detailed lens modeling,…
For any $\Lambda>0$, let $\mathcal{M}_{n,\Lambda}$ denote the space containing all locally Lipschitz minimal graphs of dimension $n$ and of arbitrary codimension $m$ in Euclidean space $\mathbb{R}^{n+m}$ with uniformly bounded 2-dilation…
We present a complete classification of minimal problems for generic arrangements of points and lines in space observed partially by three calibrated perspective cameras when each line is incident to at most one point. This is a large class…
A tetrahedral curve is a space curve whose defining ideal is an intersection of powers of monomial prime ideals of height two. It is supported on a tetrahedral configuration of lines. Schwartau described when certain such curves are ACM,…
It is well known that a triangulation of a closed 2-manifold is tight with respect to a field of characteristic two if and only if it is neighbourly; and it is tight with respect to a field of odd characteristic if and only if it is…
A tetrahedral complex all of whose tetrahedra meet at a common vertex is called a \textit{vertex star}. Vertex stars are a natural generalization of planar triangulations, and understanding splines on vertex stars is a crucial step to…
Flips in triangulations of convex polygons arise in many different settings. They are isomorphic to rotations in binary trees, define edges in the 1-skeleton of the Associahedron and cover relations in the Tamari Lattice. The complexity of…
A triangulation of a surface is \emph{irreducible} if there is no edge whose contraction produces another triangulation of the surface. We prove that every irreducible triangulation of a surface with Euler genus $g\geq1$ has at most $13g-4$…
In this paper we present methods for triangulation of infinite cylinders from image line silhouettes. We show numerically that linear estimation of a general quadric surface is inherently a badly posed problem. Instead we propose to…