Related papers: A New Robust Algorithm for Computation of a Triang…

In this paper, helicoidal flat surfaces in the $3$-dimensional sphere $\mathbb{S}^3$ are considered. A complete classification of such surfaces is given in terms of their first and second fundamental forms and by linear solutions of the…

We prove a novel method for the embedding of a 3-fold rotationally symmetric sphere-type mesh onto a subset of the plane with 3-fold rotational symmetry. The embedding is free-boundary with the only additional constraint on the image set is…

Boundary integral methods are highly suited for problems with complicated geometries, but require special quadrature methods to accurately compute the singular and nearly singular layer potentials that appear in them. This paper presents a…

Geometry processing presents a variety of difficult numerical problems, each seeming to require its own tailored solution. This breadth is largely due to the expansive list of geometric primitives, e.g., splines, triangles, and hexahedra,…

Regina is a software package for studying 3-manifold triangulations and normal surfaces. It includes a graphical user interface and Python bindings, and also supports angle structures, census enumeration, combinatorial recognition of…

We present a computer assisted proof or diffusion in the Planar Elliptic Restricted Three Body Problem. We treat the elliptic problem as a perturbation of the circular problem, where the perturbation parameter is the eccentricity of the…

Space-filling designs are popular choices for computer experiments. A sliced design is a design that can be partitioned into several subdesigns. We propose a new type of sliced space-filling design called sliced rotated sphere packing…

Speckle Imaging based on triple correlation is a very efficient image reconstruction technique which is used to retrieve Fourier phase information of the object in presence of atmospheric turbulence. We have developed both Direct Bispectrum…

Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic…

Approximating a function with a finite series, e.g., involving polynomials or trigonometric functions, is a critical tool in computing and data analysis. The construction of such approximations via now-standard approaches like least squares…

A convex polygon Q is circumscribed about a convex polygon P if every vertex of P lies on at least one side of Q. We present an algorithm for finding a maximum area convex polygon circumscribed about any given convex n-gon in O(n^3) time.…

We introduce an inference-time scene optimization algorithm utilizing triangle soup, a collection of disconnected translucent triangle primitives, as the representation for the geometry and appearance of a scene. Unlike full-rank Gaussian…

Computed Tomography (CT) has been widely adopted in medicine and it is increasingly being used in scientific and industrial applications. Parallelly, research in different mathematical areas concerning discrete inverse problems has led to…

We propose the first GPU algorithm for the 3D triangulation refinement problem. For an input of a piecewise linear complex $\mathcal{G}$ and a constant $B$, it produces, by adding Steiner points, a constrained Delaunay triangulation…

In a previous paper, we proved a number of optimal rigidity results for Riemannian manifolds of dimension greater than four whose curvature satisfy an integral pinching. In this article, we use the same integral Bochner technique to extend…

This paper considers the problem of recovering an ensemble of Diracs on a sphere from its low resolution measurements. The Diracs can be located at any location on the sphere, not necessarily on a grid. We show that under a separation…

0-efficient triangulations of 3-manifolds are defined and studied. It is shown that any triangulation of a closed, orientable, irreducible 3-manifold M can be modified to a 0-efficient triangulation or M can be shown to be one of the…

Recent research on computing the diameter of geometric intersection graphs has made significant strides, primarily focusing on the 2D case where truly subquadratic-time algorithms were given for simple objects such as unit-disks and…

This is a paper about triangle cubics and conics in classical geometry with elements of projective geometry. In recent years, N.J. Wildberger has actively dealt with this topic using an algebraic perspective. Triangle conics were also…

Point cloud normal estimation is a fundamental task in 3D geometry processing. While recent learning-based methods achieve notable advancements in normal prediction, they often overlook the critical aspect of equivariance. This results in…