English
Related papers

Related papers: When alpha-complexes collapse onto codimension-1 s…

200 papers

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…

Computational Geometry · Computer Science 2007-05-23 Jeff Erickson

It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…

Complex Variables · Mathematics 2020-09-29 Purvi Gupta , Rasul Shafikov

We study a notion of strict pseudoconvexity in the context of topologically (often unsmoothably) embedded 3-manifolds in complex surfaces. Topologically pseudoconvex (TPC) 3-manifolds behave similarly to their smooth analogues, cutting out…

Geometric Topology · Mathematics 2023-04-18 Robert E. Gompf

In this paper we describe a procedure for refining the given triangulation of a 3-manifold that scales the PL-metric according to a given weight function while creating no new normal surfaces. It is known that an incompressible surface $F$…

Geometric Topology · Mathematics 2008-10-02 Tejas Kalelkar

This paper resolves a longstanding open question pertaining to the design of near-optimal first-order algorithms for smooth and strongly-convex-strongly-concave minimax problems. Current state-of-the-art first-order algorithms find an…

Optimization and Control · Mathematics 2021-07-27 Tianyi Lin , Chi Jin , Michael. I. Jordan

We present a simple algorithm for computing higher-order Delaunay mosaics that works in Euclidean spaces of any finite dimensions. The algorithm selects the vertices of the order-$k$ mosaic from incrementally constructed lower-order mosaics…

Computational Geometry · Computer Science 2020-11-10 Herbert Edelsbrunner , Georg Osang

We present a new and simple randomized algorithm for constructing the Delaunay triangulation using nearest neighbor graphs for point location. Under suitable assumptions, it runs in linear expected time for points in the plane with…

Computational Geometry · Computer Science 2009-12-13 Kevin Buchin

The alpha complex is a subset of the Delaunay triangulation and is often used in computational geometry and topology. One of the main drawbacks of using the alpha complex is that it is non-monotone, in the sense that if ${\cal…

Computational Geometry · Computer Science 2021-05-19 Yohai Reani , Omer Bobrowski

In this paper, we propose a novel parameterization method for genus-one and multiply connected genus-zero surfaces, called periodic conformal flattening. The conformal energy minimization technique is utilized to compute the desired…

Numerical Analysis · Mathematics 2025-04-10 Zhong-Heng Tan , Tiexiang Li , Wen-Wei Lin , Shing-Tung Yau

We give a damped proximal augmented Lagrangian method (DPALM) for solving problems with a weakly-convex objective and convex linear/nonlinear constraints. Instead of taking a full stepsize, DPALM adopts a damped dual stepsize to ensure the…

Optimization and Control · Mathematics 2025-11-20 Hari Dahal , Wei Liu , Yangyang Xu

We define a new combinatorial class of triangulations of closed 3-manifolds, satisfying a weak version of 0-efficiency combined with a weak version of minimality, and study them using twisted squares. As an application, we obtain strong…

Geometric Topology · Mathematics 2015-12-23 Feng Luo , Stephan Tillmann

Given a sequence of properly embedded minimal surfaces in a $3$-manifold with local bounds on area and genus, we prove subsequential convergence, smooth away from a discrete set, to a smooth embedded limit surface, possibly with…

Differential Geometry · Mathematics 2024-01-26 Brian White

We study constrained nested stochastic optimization problems in which the objective function is a composition of two smooth functions whose exact values and derivatives are not available. We propose a single time-scale stochastic…

Optimization and Control · Mathematics 2019-09-09 Saeed Ghadimi , Andrzej Ruszczyński , Mengdi Wang

This paper introduces a smoothed proximal Lagrangian method for minimizing a nonconvex smooth function over a convex domain with additional explicit convex nonlinear constraints. Two key features are 1) the proposed method is single-looped,…

Optimization and Control · Mathematics 2024-08-28 Wenqiang Pu , Kaizhao Sun , Jiawei Zhang

We study upper bounds on the box-counting dimension of the set of potential singular points in suitable weak solutions to the 3D incompressible hyperdissipative Navier-Stokes system \begin{equation*} \partial_t u +…

Analysis of PDEs · Mathematics 2025-07-04 Min Jun Jo

This paper proposes QPALM, a proximal augmented Lagrangian method based on quadratic approximations, for solving nonlinear programming problems with weakly convex objective and constraint functions. The algorithm is constructed by…

Optimization and Control · Mathematics 2026-05-06 Yule Zhang , Benqi Liu , Xiantao Xiao , Liwei Zhang

We consider ancient solutions to the mean curvature flow in $\mathbb{R}^{n+1}$ ($n \geq 3$) that are weakly convex, uniformly two-convex, and satisfy derivative estimates $|\nabla A| \leq \gamma_1 |H|^2, |\nabla^2 A| \leq \gamma_2 |H|^3$.…

Differential Geometry · Mathematics 2020-04-20 Keaton Naff

Consider a set $P$ of $n$ points picked uniformly and independently from $[0,1]^d$ for a constant dimension $d$ -- such a point set is extremely well behaved in many aspects. For example, for a fixed $r \in [0,1]$, we prove a new…

Computational Geometry · Computer Science 2023-11-01 Sariel Har-Peled , Elfarouk Harb

Dimension 4 is the first dimension in which exotic smooth manifold pairs appear -- manifolds which are topologically the same but for which there is no smooth deformation of one into the other. Whilst smooth and triangulated 4-manifolds do…

Geometric Topology · Mathematics 2024-02-27 Rhuaidi Antonio Burke

By introducing a finer version of the Kauffman bracket skein algebra, we show how to decompose the Kauffman bracket skein algebra of a surface into elementary blocks corresponding to the triangles in an ideal triangulation of the surface.…

Geometric Topology · Mathematics 2016-09-19 Thang T. Q. Le