English
Related papers

Related papers: On the Stretch Factor of Polygonal Chains

200 papers

In a geometric graph, $G$, the \emph{stretch factor} between two vertices, $u$ and $w$, is the ratio between the Euclidean length of the shortest path from $u$ to $w$ in $G$ and the Euclidean distance between $u$ and $w$. The \emph{average…

Computational Geometry · Computer Science 2013-12-02 Vida Dujmovic , Pat Morin , Michiel Smid

We consider a random graph G(n,p) whose vertex set V has been randomly embedded in the unit square and whose edges are given weight equal to the geometric distance between their end vertices. Then each pair {u,v} of vertices have a distance…

Computational Geometry · Computer Science 2013-04-10 Abbas Mehrabian , Nick Wormald

In this paper we show that the \theta-graph with 4 cones has constant stretch factor, i.e., there is a path between any pair of vertices in this graph whose length is at most a constant times the Euclidean distance between that pair of…

Computational Geometry · Computer Science 2013-03-25 Luis Barba , Prosenjit Bose , Jean-Lou De Carufel , André van Renssen , Sander Verdonschot

We consider random walk model of a semi-flexible polymer chain on a square and a cubic lattice to enumerate conformations of the polymer chain in two and three dimensions, respectively. The bending energy of the chain is assumed as the key…

Soft Condensed Matter · Physics 2020-08-04 Pramod Kumar Mishra

The shape of a polymer plays an important role in determining its interactions with other molecules and with the environment, and is in turn affected by both of them. As a consequence, in the literature the shape properties of a chain in…

Soft Condensed Matter · Physics 2017-07-26 Alberto S. Sassi , Salvatore Assenza , Paolo De Los Rios

Let $S$ be a finite set of points in the Euclidean plane. Let $D$ be a Delaunay triangulation of $S$. The {\em stretch factor} (also known as {\em dilation} or {\em spanning ratio}) of $D$ is the maximum ratio, among all points $p$ and $q$…

Computational Geometry · Computer Science 2013-08-30 Ge Xia

A spanning tree of an unweighted graph is a minimum average stretch spanning tree if it minimizes the ratio of sum of the distances in the tree between the end vertices of the graph edges and the number of graph edges. We consider the…

Data Structures and Algorithms · Computer Science 2014-04-15 N. S. Narayanaswamy , G. Ramakrishna

Let $X:=X_n\cup\{(0,0),(1,0)\}$, where $X_n$ is a planar Poisson point process of intensity $n$. We provide a first non-trivial lower bound for the distance between the expected length of the shortest path between $(0,0)$ and $(1,0)$ in the…

Probability · Mathematics 2016-07-22 Nicolas Chenavier , Olivier Devillers

While stretching of a polymer along a flat surface is hardly different from the classical Pincus problem of pulling chain ends in free space, the role of curved geometry in conformational statistics of the stretched chain is an exciting…

Soft Condensed Matter · Physics 2022-08-30 Kirill E. Polovnikov , Sergei K. Nechaev , Alexander Y. Grosberg

A polygonal curve $P$ with $n$ vertices is $c$-packed, if the sum of the lengths of the parts of the edges of the curve that are inside any disk of radius $r$ is at most $cr$, for any $r>0$. Similarly, the concept of $c$-packedness can be…

Computational Geometry · Computer Science 2022-02-04 Sepideh Aghamolaei , Vahideh Keikha , Mohammad Ghodsi , Ali Mohades

In this paper we determine the stretch factor of the $L_1$-Delaunay and $L_\infty$-Delaunay triangulations, and we show that this stretch is $\sqrt{4+2\sqrt{2}} \approx 2.61$. Between any two points $x,y$ of such triangulations, we…

Computational Geometry · Computer Science 2012-02-28 Nicolas Bonichon , Cyril Gavoille , Nicolas Hanusse , Ljubomir Perkovic

The stretching of a polymer chain by a large scale chaotic flow is considered. The steady state which emerges as a balance of the turbulent stretching and anharmonic resistance of the chain is quantitatively described, i.e. the dependency…

chao-dyn · Physics 2009-10-31 Michael Chertkov

Given an undirected $n$-node unweighted graph $G = (V, E)$, a spanner with stretch function $f(\cdot)$ is a subgraph $H\subseteq G$ such that, if two nodes are at distance $d$ in $G$, then they are at distance at most $f(d)$ in $H$.…

Data Structures and Algorithms · Computer Science 2013-01-11 Marek Cygan , Fabrizio Grandoni , Telikepalli Kavitha

A polymer network fractures by breaking covalent bonds, but the experimentally measured strength of the polymer network is orders of magnitude lower than the strength of covalent bonds. We investigate the effect of statistical variation of…

Soft Condensed Matter · Physics 2023-04-26 Manyuan Tao , Shawn Lavoie , Zhigang Suo , Maria K. Cameron

The Kirchhoff index is defined as the sum of resistance distances between all pairs of vertices in a graph. This index is a critical parameter for measuring graph structures. In this paper, we characterize polygonal chains with the minimum…

Combinatorics · Mathematics 2023-09-25 Qi Ma

For a self-repelling polymer chain consisting of n segments we calculate the persistence length L(j,n), defined as the projection of the end-to-end vector on the direction of the j`th segment. This quantity shows some pronounced variation…

Soft Condensed Matter · Physics 2009-11-10 Lothar Schäfer , Knut Elsner

The minimum feature size of a crossing-free straight line drawing is the minimum distance between a vertex and a non-incident edge. This quantity measures the resolution needed to display a figure or the tool size needed to mill the figure.…

Computational Geometry · Computer Science 2009-08-19 Greg Aloupis , Erik D. Demaine , Martin L. Demaine , Vida Dujmovic , John Iacono

Single-chain elasticity is of fundamental importance in polymer physics, as it underlies many of the unique properties of polymer systems. Recently, there has been interest in characterizing the elastic properties of catenanes, molecular…

Soft Condensed Matter · Physics 2025-12-23 James M. Polson , Liam MacNevin , Alaaddin Elobeid , Carlos E. Padilla Robles

Let P be a Poisson process of intensity one in a square S_n of area n. For a fixed integer k, join every point of P to its k nearest neighbours, creating an undirected random geometric graph G_{n,k}. We prove that there exists a critical…

Probability · Mathematics 2007-08-30 Paul Balister , Bela Bollobas , Amites Sarkar , Mark Walters

Although the stretching of polymers and biomolecules is important in numerous settings, their response when confined to two-dimensions is relatively poorly-studied. In this paper, we derive closed-form analytical expressions for the…

Soft Condensed Matter · Physics 2013-05-28 Sara Iliafar , Dmitri Vezenov , Anand Jagota
‹ Prev 1 2 3 10 Next ›