相关论文: An Analysis of Triangulation in Geometrically Nois…
We propose a hybrid image-space/object-space solution to the classical hidden surface removal problem: Given n disjoint triangles in Real^3 and p sample points (``pixels'') in the xy-plane, determine the first triangle directly behind each…
This paper uses results on the classification of minimal triangulations of 3-manifolds to produce additional results, using covering spaces. Using previous work on minimal triangulations of lens spaces, it is shown that the lens space…
In this paper we will do the following: (1) show how to geometrically define multiplication, using only basic plane geometry, independently of area and any notion of similar triangles; (2) prove all the properties of multiplication using…
We consider the problem of positioning a cloud of points in the Euclidean space $\mathbb{R}^d$, using noisy measurements of a subset of pairwise distances. This task has applications in various areas, such as sensor network localization and…
Tightness of a triangulated manifold is a topological condition, roughly meaning that any simplexwise linear embedding of the triangulation into euclidean space is "as convex as possible". It can thus be understood as a generalization of…
We investigate the problem of determining if a given graph corresponds to the dual of a triangulation of a simple polygon. This is a graph recognition problem, where in our particular case we wish to recognize a graph which corresponds to…
The geometry of the dual amplituhedron is generally described in reference to a particular triangulation. A given triangulation manifests only certain aspects of the underlying space while obscuring others, therefore understanding this…
We prove that in any $\mathbb{Z}^n$-periodic triangulation of $\mathbb{R}^n$ the number of $\mathbb{Z}^n$-orbits of $n$-dimensional simplices is at least the tensor rank of the $n$th determinant tensor. The latter is known to be at least…
Source localization is widely used in many areas including GPS, but the influence of possible noises is not so negligible. Many optimization methods are attempted to alleviate different kinds of noises. Needless to say the stability of the…
We consider several basic questions pertaining to the geometry of image of a general quadratic map. In general the image of a quadratic map is non-convex, although there are several known classes of quadratic maps when the image is convex.…
We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…
We propose a method for computing upper bounds for the Heilbronn problem for triangles.
Recently dictionary screening has been proposed as an effective way to improve the computational efficiency of solving the lasso problem, which is one of the most commonly used method for learning sparse representations. To address today's…
Triangulation refers to the problem of finding a 3D point from its 2D projections on multiple camera images. For solving this problem, it is the common practice to use so-called optimal triangulation method, which we call the L2 method in…
The O(3) nonlinear sigma model with boundary, in dimension two, is considered. An algorithm to determine all its soliton solutions that preserve a rotational symmetry in the boundary is exhibited. This nonlinear problem is reduced to that…
Many optimization tasks have to be handled in noisy environments, where we cannot obtain the exact evaluation of a solution but only a noisy one. For noisy optimization tasks, evolutionary algorithms (EAs), a kind of stochastic…
Many questions about triangles and quadrilaterals with rational sides, diagonals and areas can be reduced to solving certain Diophantine equations. We look at a number of such questions including the question of approximating arbitrary…
Resolutions of certain toroidal orbifolds, like T6/Z2xZ2, are far from unique, due to triangulation dependence of their resolved local singularities. This leads to an explosion of the number of topologically distinct smooth geometries…
The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is proved to be NP-hard. We discuss other related complexity results.
Creating geometric abstracted models from image-based scene reconstructions is difficult due to noise and irregularities in the reconstructed model. In this paper, we present a geometric modeling method for noisy reconstructions dominated…