Related papers: Proximal Delaunay Triangulation Regions
We propose a template-driven triangulation framework that embeds raster- or segmentation-derived boundaries into a regular triangular grid for stable PDE discretization on image-derived domains. Unlike constrained Delaunay triangulation…
We consider compact connected minimal surfaces, with a pair of boundary curves (not necessarily convex) in distinct planes, that have least-area amongst all orientable surfaces with the same boundary. When the planes containing these two…
We provide an alternative, simpler proof of the existence of thick triangulations for noncompact $\mathcal{C}^1$ manifolds. Moreover, this proof is simpler than the original one given in \cite{pe}, since it mainly uses tools of elementary…
Let $K$ be a convex pentagon in the plane and let $K_1$ be the pentagon bounded by the diagonals of $K$. It has been conjectured that the maximum of the ratio between the areas of $K_1$ and $K$ is reached when $K$ is an affine regular…
Reay's relaxed Tverberg conjecture and Conway's thrackle conjecture are open problems about the geometry of pairwise intersections. Reay asked for the minimum number of points in Euclidean d-space that guarantees any such point set admits a…
We study tilings of polygons $R$ with arbitrary convex polygonal tiles. Such tilings come in continuous families obtained by moving tile edges parallel to themselves (keeping edge directions fixed). We study how the tile shapes and areas…
A convex subset X of a linear topological space is called compactly convex if there is a continuous compact-valued map $\Phi:X\to exp(X)$ such that $[x,y]\subset\Phi(x)\cup \Phi(y)$ for all $x,y\in X$. We prove that each convex subset of…
We establish a region of convergence for the proto-typical non-convex Douglas-Rachford iteration which finds a point on the intersection of a line and a circle. Previous work on the non-convex iteration [2] was only able to establish local…
In \cite{Wu22}, under the uniformly acute condition, Wu showed the rigidity of the geodesic triangulated plane under Luo's discrete conformality. In this article, by modifying Wu's proof, we improve this result by weakening the uniformly…
A groupoid is a small category in which each morphism has an inverse. A topological groupoid is a groupoid in which both sets of objects and morphisms have topologies such that all groupoid structure maps are continuous. The notion of…
We consider consecutive random subdivision of polygons described as follows. Given an initial convex polygon with $d\ge 3$ edges, we choose a point at random on each edge, such that the proportions in which these points divide edges are…
For a locally quasi-convex (lqc) abelian group $G$, we give the first description of all compatible group topologies on $G$ and apply this result to the Mackey group problem for lqc groups. We characterize lqc abelian groups which are…
We consider two types of geometric graphs on point sets on the plane based on a plane set C: one obtained by translates of C, another by positively scaled translates (homothets) of C. For compact and convex C, graphs defined by scaled…
We prove that a pair of proximal Klee-Phelps convex groupoids $A(\circ)$,$B(\circ)$ in a finite-dimensional normed linear space $E$ are normed proximal, {\em i.e.}, $A(\circ)\ \delta\ B(\circ)$ if and only if the groupoids are normed…
In this article, we investigate for some sufficient conditions for the existence and uniqueness of best proximity points for the topological $p$-proximal contractions and $p$-proximal contractive mappings on arbitrary topological spaces.…
A rectangular layout is a partition of a rectangle into a finite set of interior-disjoint rectangles. Rectangular layouts appear in various applications: as rectangular cartograms in cartography, as floorplans in building architecture and…
We study the problem of existence of preduals of locally convex Hausdorff spaces. We derive necessary and sufficient conditions for the existence of a predual with certain properties of a bornological locally convex Hausdorff space $X$.…
We prove that every polynomially convex arc is contained in a polynomially convex simple closed curve. We also establish results about polynomial hulls of arcs and curves that are locally rectifiable outside a polynomially convex subset.
This paper is the second part of a two-part paper investigating the structure and properties of dyadic polygons. A dyadic polygon is the intersection of the dyadic subplane $D^2$ of the real plane $R^2$ and a real convex polygon with…
In this study, the properties of convex hexagons that can form rotationally symmetric edge-to-edge tilings are discussed. Because the convex hexagons are equilateral convex parallelohexagons, convex pentagons generated by bisecting the…