Oswin Aichholzer, David Orden, Francisco Santos, Bettina Speckmann
We pose a monotonicity conjecture on the number of pseudo-triangulations of any planar point set, and check it on two prominent families of point sets, namely the so-called double circle and double chain. The latter has asymptotically $12^n n^{Θ(1)}$ pointed pseudo-triangulations, which lies significantly above the maximum number of triangulations in a planar point set known so far.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
In 1996, Matheson and Tarjan conjectured that any n-vertex triangulation with n sufficiently large has a dominating set of size at most n/4. We prove this for graphs of maximum degree 6.
We study the maximum numbers of pseudo-triangulations and pointed pseudo-triangulations that can be embedded over a specific set of points in the plane or contained in a specific triangulation. We derive the bounds $O(5.45^N)$ and $Ω(2.41^N)$ for the maximum number of pointed pseudo-triangulations that can be contained in a specific triangulation over a set of $N$ points. For the number of all pseudo-triangulations contained in a triangulation we derive the bounds $O^*(6.54^N)$ and $Ω(3.30^N)$. We also prove that $O^*(89.1^N)$ pointed pseudo-triangulations can be embedded over any specific set…
This paper introduces even triangulations of n-dimensional pseudo-manifolds and links their combinatorics to the topology of the pseudo-manifolds. This is done via normal hypersurface theory and the study of certain symmetric representation. In dimension 3, necessary and sufficient conditions for the existence of even triangulations having one or two vertices are given. For Haken n-manifolds, an interesting connection between very short hierarchies and even triangulations is observed.
A pseudo-triangle is a simple polygon with three convex vertices, and a pseudo-triangulation is a face-to-face tiling of a planar region into pseudo-triangles. Pseudo-triangulations appear as data structures in computational geometry, as planar bar-and-joint frameworks in rigidity theory and as projections of locally convex surfaces. This survey of current literature includes combinatorial properties and counting of special classes, rigidity theoretical results, representations as polytopes, straight-line drawings from abstract versions called combinatorial pseudo-triangulations, algorithms an…
The complete sets of irreducible triangulations are known for the orientable surfaces with genus of 0, 1, or 2 and for the nonorientable surfaces with genus of 1, 2, 3, or 4. By examining these sets we determine some of the properties of these irreducible triangulations.
We wish to draw attention to an interesting and promising interaction of two theories. On the one hand, it is the theory of \textbf{pseudo-triangulations} which was useful for implicit solution of thecarpenter's rule problem and proved later to give a nice tool for graph embeddings. On the other hand, it is the theory of hyperbolic virtual polytopes which arose from an old uniqueness conjecture for convex bodies (A. D. Alexandrov's problem): suppose that a constant $C$ separates (non-strictly) everywhere the principal curvature radii of a smooth 3-dimensional convex body $K$. Then $K$ is neces…
Let $P\subset\mathbb{R}^{2}$ be a set of $n$ points. In this paper we show two new algorithms, one to compute the number of triangulations of $P$, and one to compute the number of pseudo-triangulations of $P$. We show that our algorithms run in time $O^{*}(t(P))$ and $O^{*}(pt(P))$ respectively, where $t(P)$ and $pt(P)$ are the largest number of triangulation paths (T-paths) and pseudo-triangulations paths (PT-paths), respectively, that the algorithms encounter during their execution. Moreover, we show that $t(P) = O^{*}(9^{n})$, which is the first non-trivial bound on $t(P)$ to be known. Whil…
We study flip graphs of triangulations whose maximum vertex degree is bounded by a constant $k$. In particular, we consider triangulations of sets of $n$ points in convex position in the plane and prove that their flip graph is connected if and only if $k > 6$; the diameter of the flip graph is $O(n^2)$. We also show that, for general point sets, flip graphs of pointed pseudo-triangulations can be disconnected for $k \leq 9$, and flip graphs of triangulations can be disconnected for any $k$. Additionally, we consider a relaxed version of the original problem. We allow the violation of the degr…
We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of math.CO/0307347 which treats the minimally generically rigid case. The proof uses the concept of combinatorial pseudo-triangulation, CPT, in the plane and has two main steps: showing that a certain ``generalized Laman property'' is a necessary and sufficient condition for a CPT to be ``stretchable'', and showing that all generically rigid plane graphs admit a CPT assignment with that property. Additionally, we propose the study of combi…
We show that every simple planar near-triangulation with minimum degree at least three contains two disjoint total dominating sets. The class includes all simple planar triangulations other than the triangle. This affirms a conjecture of Goddard and Henning [Thoroughly dispersed colorings, J. Graph Theory, 88 (2018) 174-191].
A dominating set D of a graph G is a set such that each vertex v of G is either in the set or adjacent to a vertex in the set. Matheson and Tarjan (1996) proved that any n-vertex plane triangulation has a dominating set of size at most n/3, and conjectured a bound of n/4 for n sufficiently large. King and Pelsmajer recently proved this for graphs with maximum degree at most 6. Plummer and Zha (2009) and Honjo, Kawarabayashi, and Nakamoto (2009) extended the n/3 bound to triangulations on surfaces. We prove two related results: (i) There is a constant c such that any n-vertex plane triangulatio…
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than 180 degrees. In this paper we prove that the opposite statement is also true, namely that planar minimally rigid graphs always admit pointed embeddings, even under certain natural topological and combinatorial constraints. We provide two proofs, which both yield efficient embedding algorithms. One based on Henneberg inductive constructions from combinatorial rigidity theory, the other on a generalization of Tutte's barycentric embeddings to directed grap…
In this paper we consider the flip operation for combinatorial pointed pseudo-triangulations where faces have size 3 or 4, so-called combinatorial 4-PPTs. We show that every combinatorial 4-PPT is stretchable to a geometric pseudo-triangulation, which in general is not the case if faces may have size larger than 4. Moreover, we prove that the flip graph of combinatorial 4-PPTs is connected and has diameter $O(n^2)$, even in the case of labeled vertices with fixed outer face. For this case we provide an $Ω(n\log n)$ lower bound.
We study non-crossing frameworks in the plane for which the classical reciprocal on the dual graph is also non-crossing. We give a complete description of the self-stresses on non-crossing frameworks whose reciprocals are non-crossing, in terms of: the types of faces (only pseudo-triangles and pseudo-quadrangles are allowed); the sign patterns in the self-stress; and a geometric condition on the stress vectors at some of the vertices. As in other recent papers where the interplay of non-crossingness and rigidity of straight-line plane graphs is studied, pseudo-triangulations show up as objects…
We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its 1-skeleton is the graph whose vertices are the pointed pseudo-triangulations of the point set and whose edges are flips of interior pseudo-triangulation edges. For points in convex position we obtain a new realization of the associahedron, i.e., a geometric representation of the set of triangulations of an n-gon, or of the set of binary trees on n vertices, or of ma…
Independent dominating sets in planar triangulations
本文研究了平面三角剖分中独立支配集大小的最小上界问题，证明了近平面三角剖分的$ε$范围为$2/7 \leq ε\leq 5/12$，并在特定条件下进一步改进了上界。
In this paper, we consider the problem of determining in polynomial time whether a given planar point set $P$ of $n$ points admits 4-connected triangulation. We propose a necessary and sufficient condition for recognizing $P$, and present an $O(n^3)$ algorithm of constructing a 4-connected triangulation of $P$. Thus, our algorithm solves a longstanding open problem in computational geometry and geometric graph theory. We also provide a simple method for constructing a noncomplex triangulation of $P$ which requires $O(n^2)$ steps. This method provides a new insight to the structure of 4-connect…
Maximal Independent Sets in Planar Triangulations
本研究证明含n个顶点的平面三角剖分存在大小不超n/3的极大独立集，证实了相关猜想，是对三角化圆盘控制集经典结论的结构性强化。
The Barratt nerve, denoted $B$, is the endofunctor that takes a simplicial set to the nerve of the poset of its non-degenerate simplices. The ordered simplicial complex $BSd\, X$, namely the Barratt nerve of the Kan subdivision $Sd\, X$, is a triangulation of the original simplicial set $X$ in the sense that there is a natural map $BSd\, X\to X$ whose geometric realization is homotopic to some homeomorphism. This is a refinement to the result that any simplicial set can be triangulated. A simplicial set is said to be regular if each of its non-degenerate simplices is embedded along its $n$-th …
The triangulations of point configurations which decompose as a free sum are classified in terms of the triangulations of the summands. The methods employ two new kinds of partially ordered sets to be associated with any triangulation of a point set with one point marked, the "web of stars" and the "stabbing poset". Triangulations of smooth Fano polytopes are discussed as a case study.
Generalized break divisors and triangulations of Lawrence polytopes
本文利用余图拟阵 Lawrence 多面体的三角剖分定义生成树上的函数，构造图的 g 次 Picard 群代表元，并刻画其与结点曲线稳定性条件的对应关系。
Some basic mathematical tools such as convex sets, polytopes and combinatorial topology, are used quite heavily in applied fields such as geometric modeling, meshing, computer vision, medical imaging and robotics. This report may be viewed as a tutorial and a set of notes on convex sets, polytopes, polyhedra, combinatorial topology, Voronoi Diagrams and Delaunay Triangulations. It is intended for a broad audience of mathematically inclined readers. I have included a rather thorough treatment of the equivalence of V-polytopes and H-polytopes and also of the equivalence of V-polyhedra and H-poly…
We prove that properly rescaled large planar Eulerian triangulations converge to the Brownian map. This result requires more than a standard application of the methods that have been used to obtain the convergence of other families of planar maps to the Brownian map, as the natural distance for Eulerian triangulations is a canonical oriented pseudo-distance. To circumvent this difficulty, we adapt the layer decomposition method established by Curien and Le Gall, which yields asymptotic proportionality between three natural distances on planar Eulerian triangulations: the usual graph distance, …
We prove a discrete analogue to a classical isoperimetric theorem of Weil for surfaces with non-positive curvature. It is shown that hexagons in the triangular lattice have maximal volume among all sets of a given boundary in any triangulation with minimal degree 6.
Associahedra minimize $f$-vectors of secondary polytopes of planar point sets
本文推广了关于平点集三角剖分数量的下界结果，证明正则三角剖分已足够，并将结论扩展到所有正则细分，按次级多面体中面的维度分级。
Connected Dominating Sets in Triangulations
本文证明任意n顶点三角剖分存在大小至多10n/21的连通支配集，等价于存在至少11n/21个叶子的生成树，改进了此前n/2的界，并应用于SEFENOMAP图绘制问题及亏格g曲面三角剖分。
For a set $A$ of points in the plane, not all collinear, we denote by ${\rm tr}(A)$ the number of triangles in any triangulation of $A$; that is, ${\rm tr}(A) = 2i+b-2$ where $b$ and $i$ are the numbers of points of $A$ in the boundary and the interior of $[A]$ (we use $[A]$ to denote "convex hull of $A$"). We conjecture the following analogue of the Brunn-Minkowski inequality: for any two point sets $A,B \subset {\mathbb R}^2$ one has \[ {\rm tr}(A+B)^{\frac12}\geq {\rm tr}(A)^{\frac12}+{\rm tr}(B)^{\frac12}. \] We prove this conjecture in several cases: if $[A]=[B]$, if $B=A\cup\{b\}$, if $|…
We show that, if a $n$-vertex triangulation $T$ of maximum degree $Δ$ has a dual that contains a cycle of length $\ell$, then $T$ has a non-crossing straight-line drawing in which some \emph{collinear set} of $Ω(\ell/Δ^4)$ vertices lie on a line. Using the current lower bounds on the length of longest cycles in 3-regular 3-connected graphs, this implies that every $n$-vertex planar graph of maximum degree $Δ$ has a collinear set of size $Ω(n^{0.8}/Δ^4)$. Very recently, Dujmović et. al. (SODA 2019) showed that, if $S$ is a collinear set in a triangulation $T$ then, for any point set $X\subset\m…
Triangulations Admit Dominating Sets of Size $2n/7$
本文证明了平面三角剖分存在大小为$2n/7$的支配集，逼近Matheson和Tarjan的猜想，通过引入惩罚函数与骨架三角剖分类进行归纳证明，并给出了二次时间的构造算法。
Large chirotopes with computable numbers of triangulations
本文提出了一种计算平面点集支持的三角剖分数目的方法，通过推广手性拓扑的运算并利用函数方程和核方法，得到双圆的三角剖分数目的渐近估计。
For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a geometric graph together with a subset of its vertices. The poset of non-crossing graphs on $\A$ appears as the complement of the star of a face in that polyhedron. The polyhedron has a unique maximal bounded face, of dimension $2n_i +n -3$ where $n_i$ is the number of points of $\A$ in the interior of $\conv(\A)$. The vertices of this polytope are all the pseu…
Chromatic numbers of flag 3-spheres
本文证明了对每个维数d，旗三角剖分S^d的色数不存在常数上界，并利用Ramsey理论构造了色数至少为Ω~(n^{1/4})的3-球面旗三角剖分。
We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing full triangulations only; this case is particularly relevant for tropical geometry. Most importantly, down-flip reverse search allows for massive parallelization, i.e., it scales well even for many cores. Our implementation allows to compute the triangulations of much larger point sets than before.
Face-hitting Dominating Sets in Planar Graphs
本文证明无孤立点、自环和2面的平面多重图可二分为两个支配且面命中的顶点集，并据此改进特定平面三角剖分的支配集上界。
Reconstruction of the Ranks of the Nonextremal Cards and of Ordered Sets with a Minmax Pair of Pseudo-Similar Points
本文重构了移除非极值元素及极值元素后的有序集牌组，并重构了具有极小极大伪相似点对的有序集。
In this paper, we study translation hyperovals in PG$(2,q^k)$. The main result of this paper characterises the point sets defined by translation hyperovals in the André/Bruck-Bose representation. We show that the affine point sets of translation hyperovals in PG$(2,q^k)$ are precisely those that have a scattered $\mathbb{F}_2$-linear set of pseudoregulus type in PG$(2k-1,q)$ as set of directions. This correspondence is used to generalise the results of Barwick and Jackson who provided a characterisation for translation hyperovals in PG$(2,q^2)$.
Given a finite point set P in general position in the plane, a full triangulation is a maximal straight-line embedded plane graph on P. A partial triangulation is a full triangulation of some subset P' of P containing all extreme points in P. A bistellar flip on a partial triangulation flips an edge (an edge flip), removes a non-extreme point of degree 3, or adds a point in P \ P' as vertex of degree 3. The bistellar flip graph has all partial triangulations as vertices, and a pair of partial triangulations is adjacent if they can be obtained from one another by a bistellar flip. The edge flip…
We give a self-contained introduction to the theory of secondary polytopes and geometric bistellar flips in triangulations of polytopes and point sets, as well as a review of some of the known results and connections to algebraic geometry, topological combinatorics, and other areas. As a new result, we announce the construction of a point set in general position with a disconnected space of triangulations. This shows, for the first time, that the poset of strict polyhedral subdivisions of a point set is not always connected.
Given a triangulation of a point set in the plane, a \emph{flip} deletes an edge $e$ whose removal leaves a convex quadrilateral, and replaces $e$ by the opposite diagonal of the quadrilateral. It is well known that any triangulation of a point set can be reconfigured to any other triangulation by some sequence of flips. We explore this question in the setting where each edge of a triangulation has a label, and a flip transfers the label of the removed edge to the new edge. It is not true that every labelled triangulation of a point set can be reconfigured to every other labelled triangulation…
A canonical tree decomposition for order types, and some applications
本文提出基于互避集合（模块）的手性拓扑树分解方法，证明其存在唯一性，并利用该分解高效计算手性拓扑的三角剖分数。
Contributions to conjectures on planar graphs: Induced Subgraphs, Treewidth, and Dominating Sets
本文澄清了平面图中连通支配与导出外平面子图等概念的关系，构造了连通支配数超过 n/3 的平面三角剖分无限族，否定了 Bradshaw 等人的问题，并获得了有界树宽导出子图的新结果。
We construct small (50 and 26 points, respectively) point sets in dimension 5 whose graphs of triangulations are not connected. These examples improve our construction in J. Amer. Math. Soc., 13:3 (2000), 611--637 not only in size, but also in that their toric Hilbert schemes are not connected either, a question left open in that article. Additionally, the point sets can easily be put into convex position, providing examples of 5-dimensional polytopes with non-connected graph of triangulations.
Topological lower bounds on the sizes of simplicial complexes and simplicial sets
本文证明满足特定拓扑条件的 n 维空间（如 n 维环面）在任何三角剖分或可缩面单纯集表示中至少具有 2^n 个 n 维面，给出了单纯结构大小的拓扑下界。
Partitions of planar (oriented) graphs into a connected acyclic and an independent set
围绕欧拉有向平面图的顶点划分交叉问题，研究CAI-划分的存在性，证明两类图存在该划分，并构造反例将已有结果推广至有向场景。
We show that the triangulations of a finite point set form a flip graph that can be embedded isometrically into a hypercube, if and only if the point set has no empty convex pentagon. Point sets of this type include convex subsets of lattices, points on two lines, and several other infinite families. As a consequence, flip distance in such point sets can be computed efficiently.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。