English
Related papers

Related papers: Regularity of minimal surfaces with lower dimensio…

200 papers

In this work we consider a question in the calculus of variations motivated by riemannian geometry, the isoperimetric problem. We show that solutions to the isoperimetric problem, close in the flat norm to a smooth submanifold, are…

Differential Geometry · Mathematics 2020-07-16 Stefano Nardulli

We study the regularity of quasi-minimal sets (in the sense of David and Semmes) with a boundary condition, which can be interpreted as quasi-minimizers of Plateau's problem in co-dimension one. For these Plateau-quasi-minimizers, we…

Optimization and Control · Mathematics 2025-07-18 Eve Machefert

In this paper, we study the regularity of the solution for the obstacle problem associated with the linearized Monge-Amp\`ere operator: \begin{align*} \begin{cases} &u\geq\varphi \text{\quad in } \Omega &L_{ w}u=\tr( W D^{2}u)\leq 0…

Analysis of PDEs · Mathematics 2025-08-19 Meng Ji

We investigate on the existence of smooth complete hypersurface with prescribed Weingarten curvature and asymptotic boundary at infinity in hyperbolic space under the assumption that there exists an asymptotic subsolution. We give an…

Differential Geometry · Mathematics 2022-07-01 Zhenan Sui , Wei Sun

For many fundamental problems in computational topology, such as unknot recognition and $3$-sphere recognition, the existence of a polynomial-time solution remains unknown. A major algorithmic tool behind some of the best known algorithms…

Computational Geometry · Computer Science 2024-03-08 Benjamin A. Burton , Alexander He

Biedl et al. introduced the minimum ply cover problem in CG 2021 following the seminal work of Erlebach and van Leeuwen in SODA 2008. They showed that determining the minimum ply cover number for a given set of points by a given set of…

Computational Geometry · Computer Science 2023-01-31 Siddhartha Sarkar

We consider critical points of the geometric obstacle problem on vectorial maps $u: \mathbb{B}^2 \subset \mathbb{R}^2 \to \mathbb{R}^N$ \[ \int_{\mathbb{B}^2} |\nabla u|^2 \quad \mbox{subject to $u \in \mathbb{R}^N \backslash…

Analysis of PDEs · Mathematics 2020-02-03 Sujin Khomrutai , Armin Schikorra

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

We study a general smallest intersecting ball problem and its soft-margin variant in high-dimensional Euclidean spaces for input objects that are compact and convex. These two problems link and unify a series of fundamental problems in…

Computational Geometry · Computer Science 2025-05-27 Jiaqi Zheng , Tiow-Seng Tan

The design of minimum-compliance bending-resistant structures with continuous cross-section parameters is a challenging task because of its inherent non-convexity. Our contribution develops a strategy that facilitates computing all…

Optimization and Control · Mathematics 2022-05-06 Marek Tyburec , Jan Zeman , Martin Kružík , Didier Henrion

$\renewcommand{\Re}{{\rm I\!\hspace{-0.025em} R}} \newcommand{\SetX}{\mathsf{X}} \newcommand{\eps}{\varepsilon} \newcommand{\VorX}[1]{\mathcal{V} \pth{#1}} \newcommand{\Polygon}{\mathsf{P}} \newcommand{\IntRange}[1]{[ #1 ]}…

Computational Geometry · Computer Science 2016-05-18 Sariel Har-Peled , Haim Kaplan , Micha Sharir

We solve the classical problem of Plateau in the setting of proper metric spaces. Precisely, we prove that among all disc-type surfaces with prescribed Jordan boundary in a proper metric space there exists an area minimizing disc which…

Differential Geometry · Mathematics 2016-11-23 Alexander Lytchak , Stefan Wenger

The minimum constraint removal problem seeks to find the minimum number of constraints, i.e., obstacles, that need to be removed to connect a start to a goal location with a collision-free path. This problem is NP-hard and has been studied…

Robotics · Computer Science 2023-05-03 Antony Thomas , Fulvio Mastrogiovanni , Marco Baglietto

We are studying $d$-dimensional geometric problems that have algorithms with $1-1/d$ appearing in the exponent of the running time, for example, in the form of $2^{n^{1-1/d}}$ or $n^{k^{1-1/d}}$. This means that these algorithms perform…

Data Structures and Algorithms · Computer Science 2016-12-06 Dániel Marx , Anastasios Sidiropoulos

A review on the classical Plateau problem is presented. Then, the state of the art about the Kirchhoff-Plateau problem is illustrated as well as some possible future directions of research.

Analysis of PDEs · Mathematics 2024-10-11 Giulia Bevilacqua , Luca Lussardi , Alfredo Marzocchi

Let $(M,g)$ be a smooth connected Riemannian manifold. We show an improvement of flatness theorem for hypersurfaces of $M$ of bounded nonlocal mean curvature in the viscosity sense. It implies local $ C^{1,\alpha}$ regularity of these…

Analysis of PDEs · Mathematics 2024-05-03 Julien Moy

We show that for the regular n-simplex, the 1-codimensional central slice that's parallel to a facet will achieve the minimum area (up to a 1-o(1) factor) among all 1-codimensional central slices, thus improving the previous best known…

Metric Geometry · Mathematics 2024-06-24 Colin Tang

We prove $C^{2,\alpha}$ regularity of sufficiently flat free boundaries, for the thin one-phase problem in which the free boundary occurs on a lower dimensional subspace. This problem appears also as a model of a one-phase free boundary…

Analysis of PDEs · Mathematics 2011-11-11 Daniela De Silva , Ovidiu Savin

Consider a domain D in R^3 which is convex (possibly all R^3) or which is smooth and bounded. Given any open surface M, we prove that there exists a complete, proper minimal immersion f : M --> D. Moreover, if D is smooth and bounded, then…

Differential Geometry · Mathematics 2009-03-26 Leonor Ferrer , Francisco Martin , William H. Meeks

A soap film is actually a thin solid fluid bounded by two surfaces of opposite orientation. It is natural to model the film using one polyhedron for each side. Two problems are to get the polyhedra for both sides to be in the same place…

Classical Analysis and ODEs · Mathematics 2009-09-29 Jenny Harrison