中文
相关论文

相关论文: A nongraphical obstacle problem for elastic curves

200 篇论文

In this paper, we propose a novel curvature-penalized minimal path model via an orientation-lifted Finsler metric and the Euler elastica curve. The original minimal path model computes the globally minimal geodesic by solving an Eikonal…

计算几何 · 计算机科学 2018-05-22 Da Chen , Jean-Marie Mirebeau , Laurent D. Cohen

We strengthen the connections between electrical transformations and homotopy from the planar setting---observed and studied since Steinitz---to arbitrary surfaces with punctures. As a result, we improve our earlier lower bound on the…

计算几何 · 计算机科学 2019-03-27 Hsien-Chih Chang , Marcos Cossarini , Jeff Erickson

We consider the problem of minimizing Euler's elastica energy for simple closed curves confined to the unit disk. We approximate a simple closed curve by the zero level set of a function with values +1 on the inside and -1 on the outside of…

偏微分方程分析 · 数学 2010-05-21 Patrick W. Dondl , Luca Mugnai , Matthias Röger

A finite element approach to the elastic flow of a curve coupled with a diffusion equation on the curve is analysed. Considering the graph case, the problem is weakly formulated and approximated with continuous linear finite elements, which…

数值分析 · 数学 2017-07-28 Paola Pozzi , Björn Stinner

Temporal graphs provide a useful model for many real-world networks. Unfortunately the majority of algorithmic problems we might consider on such graphs are intractable. There has been recent progress in defining structural parameters which…

离散数学 · 计算机科学 2024-11-20 Jessica Enright , Samuel D. Hand , Laura Larios-Jones , Kitty Meeks

Temporal graphs have edge sets that change over discrete time steps. Such graphs are temporally connected (TC) if all pairs of vertices can reach each other using paths that traverse the edges in a time-respecting way (temporal paths).…

数据结构与算法 · 计算机科学 2026-04-28 Arnaud Casteigts , Hendrik Molter , Meirav Zehavi

The equations of a planar elastica under pressure can be rewritten in a useful form by parametrising the variables in terms of the local orientation angle, $\theta$, instead of the arc length. This ``$\theta$-formulation'' lends itself to a…

软凝聚态物质 · 物理学 2023-07-25 Gregory Kozyreff , Emmanuel Siéfert , Basile Radisson , Fabian Brau

We investigate the Minimum Eccentricity Shortest Path problem in some structured graph classes. It asks for a given graph to find a shortest path with minimum eccentricity. Although it is NP-hard in general graphs, we demonstrate that a…

离散数学 · 计算机科学 2015-11-17 Feodor F. Dragan , Arne Leitert

We study optimization problems for partially hinged rectangular plates, modeling bridge roadways, in the presence of real and artificial obstacles. Real obstacles represent structural constraints to avoid, while artificial ones are…

最优化与控制 · 数学 2025-11-07 Elvise Berchio , Filomena Feo , Antonio Giuseppe Grimaldi

We introduce variational problems on Riemannian manifolds with constrained acceleration and derive necessary conditions for normal extremals in the constrained variational problem. The problem consists on minimizing a higher-order energy…

最优化与控制 · 数学 2022-02-25 Alexandre Anahory Simoes , Leonardo Colombo

We prove essentially tight lower bounds, conditionally to the Exponential Time Hypothesis, for two fundamental but seemingly very different cutting problems on surface-embedded graphs: the Shortest Cut Graph problem and the Multiway Cut…

计算复杂性 · 计算机科学 2021-02-18 Vincent Cohen-Addad , Éric Colin de Verdière , Daniel Marx , Arnaud de Mesmay

Purpose: This is an attempt to better bridge the gap between the mathematical and the engineering/physical aspects of the topic. We trace the different sources of non-convexification in the context of topology optimization problems starting…

最优化与控制 · 数学 2022-06-08 Mohamed Abdelhamid , Aleksander Czekanski

Given finitely many connected polygonal obstacles $O_1,\dots,O_k$ in the plane and a set $P$ of points in general position and not in any obstacle, the {\em visibility graph} of $P$ with obstacles $O_1,\dots,O_k$ is the (geometric) graph…

组合数学 · 数学 2017-09-08 John Gimbel , Patrice Ossona de Mendez , Pavel Valtr

In a recent work, we introduced a parametric framework for obtaining obstruction characterizations of graph parameters with respect to a quasi-ordering $\leqslant$ on graphs. Towards this, we proposed the concepts of class obstruction,…

离散数学 · 计算机科学 2026-05-04 Christophe Paul , Evangelos Protopapas , Dimitrios M. Thilikos

For a smooth closed embedded planar curve $\Gamma$, we consider the minimization problem of the Willmore energy among immersed surfaces of a given genus $\mathfrak{g}\geq1$ having the curve $\Gamma$ as boundary, without any prescription on…

偏微分方程分析 · 数学 2021-09-29 Marco Pozzetta

In the NP-hard Edge Dominating Set problem (EDS) we are given a graph $G=(V,E)$ and an integer $k$, and need to determine whether there is a set $F\subseteq E$ of at most $k$ edges that are incident with all (other) edges of $G$. It is…

数据结构与算法 · 计算机科学 2019-01-14 Eva-Maria C. Hols , Stefan Kratsch

We consider $\mathbb{S}^2$-valued maps on a domain $\Omega\subset\mathbb{R}^N$ minimizing a perturbation of the Dirichlet energy with vertical penalization in $\Omega$ and horizontal penalization on $\partial\Omega$. We first show the…

偏微分方程分析 · 数学 2021-07-01 Giovanni Di Fratta , Antonin Monteil , Valeriy Slastikov

We prove optimal regularity and a detailed analysis of the free boundary of the solutions to the thin obstacle problem for nonparametric minimal surfaces with flat obstacles.

偏微分方程分析 · 数学 2020-03-23 Matteo Focardi , Emanuele Spadaro

We apply the direct method of the calculus of variations to show that any nonplanar Frenet curve in $\mathbb{R}^{3}$ can be extended to an infinitely narrow flat ribbon having minimal bending energy. We also show that, in general,…

微分几何 · 数学 2024-06-04 Simon Blatt , Matteo Raffaelli

We study a two parameter family of energy minimization problems for interaction energies $\mathcal{E}_{\alpha,\beta}$ with attractive-repulsive potential $W_{\alpha,\beta}$. We develop a concavity principle, which allows us to provide a…

最优化与控制 · 数学 2024-04-04 Cameron Davies