Related papers: Robust and Accurate Cylinder Triangulation
Visualization of implicit surfaces is an actively researched topic. While raytracing can produce high quality images, it is not well suited for creating a quick preview of the surface. Indirect algorithms (e.g. Marching Cubes) create an…
We present new iterative algorithms for solving a square linear system $Ax=b$ in dimension $n$ by employing the {\it Triangle Algorithm} \cite{kal12}, a fully polynomial-time approximation scheme for testing if the convex hull of a finite…
Solving linear systems of polynomial equations is a ubiquitous problem in both mathematics and physics. The standard approach, Gaussian elimination, scales cubically with system size and often constitutes a computational bottleneck. The…
Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…
The capacity of automatically modeling photographic composition is valuable for many real-world machine vision applications such as digital photography, image retrieval, image understanding, and image aesthetics assessment. The triangle…
This paper is concerned with the inverse scattering problem by an unbounded rough surface. A direct imaging method is proposed to reconstruct the rough surface from the scattered near-field Cauchy data generating by point sources and…
Humans perceive and construct the world as an arrangement of simple parametric models. In particular, we can often describe man-made environments using volumetric primitives such as cuboids or cylinders. Inferring these primitives is…
Non-blind image deblurring is typically formulated as a linear least-squares problem regularized by natural priors on the corresponding sharp picture's gradients, which can be solved, for example, using a half-quadratic splitting method…
Based on the geometric {\it Triangle Algorithm} for testing membership of a point in a convex set, we present a novel iterative algorithm for testing the solvability of a real linear system $Ax=b$, where $A$ is an $m \times n$ matrix of…
This paper introduces a novel geometric multigrid solver for unstructured curved surfaces. Multigrid methods are highly efficient iterative methods for solving systems of linear equations. Despite the success in solving problems defined on…
Starting with the irreducible triangulations of a fixed surface and splitting vertices, all the triangulations of the surface up to a given number of vertices can be generated. The irreducible triangulations have previously been determined…
We propose a novel method to accurately reconstruct a set of images representing a single scene from few linear multi-view measurements. Each observed image is modeled as the sum of a background image and a foreground one. The background…
Usual Structure-from-Motion (SfM) techniques require at least trifocal overlaps to calibrate cameras and reconstruct a scene. We consider here scenarios of reduced image sets with little overlap, possibly as low as two images at most seeing…
For robust visual-inertial SLAM in perceptually-challenging indoor environments,recent studies exploit line features to extract descriptive information about scene structure to deal with the degeneracy of point features. But existing…
Curvature has received increased attention as an important alternative to length based regularization in computer vision. In contrast to length, it preserves elongated structures and fine details. Existing approaches are either inefficient,…
Ill-posed linear inverse problems (ILIP), such as restoration and reconstruction, are a core topic of signal/image processing. A standard approach to deal with ILIP uses a constrained optimization problem, where a regularization function is…
This paper is concerned with the inverse time-harmonic elastic scattering problem of recovering unbounded rough surfaces in two dimensions. We assume that elastic plane waves with different directions are incident onto a rigid rough surface…
We present the results of a large-scale simulation of a Dynamically Triangulated Random Surface with extrinsic curvature embedded in three-dimensional flat space. We measure a variety of local observables and use a finite size scaling…
This paper gives sharp linear bounds on the genus of a normal surface in a triangulated compact, orientable 3--manifold in terms of the quadrilaterals in its cell decomposition---different bounds arise from varying hypotheses on the surface…
We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility…