排序方式: 共有32条查询结果,搜索用时 171 毫秒
1.
O. Aichholzer C. Huemer S. Kappes B. Speckmann Cs. D. Tóth 《Graphs and Combinatorics》2007,23(5):481-507
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their complexity. Our upper bounds depend on new Ramsey-type results concerning disjoint empty convex k-gons in point sets. 相似文献
2.
Oswin Aichholzer Thomas Hackl David Orden Pedro Ramos Günter Rote André Schulz Bettina Speckmann 《Graphs and Combinatorics》2013,29(6):1577-1593
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 ≤ 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 degree bound k by a small constant. Any two triangulations with maximum degree at most k of a convex point set are connected in the flip graph by a path of length O(n log n), where every intermediate triangulation has maximum degree at most k + 4. 相似文献
3.
O. Aichholzer G. Araujo-Pardo N. García-Colín T. Hackl D. Lara C. Rubio-Montiel J. Urrutia 《Graphs and Combinatorics》2016,32(2):431-451
The pseudoachromatic index of a graph is the maximum number of colors that can be assigned to its edges, such that each pair of different colors is incident to a common vertex. If for each vertex its incident edges have different color, then this maximum is known as achromatic index. Both indices have been widely studied. A geometric graph is a graph drawn in the plane such that its vertices are points in general position, and its edges are straight-line segments. In this paper we extend the notion of pseudoachromatic and achromatic indices for geometric graphs, and present results for complete geometric graphs. In particular, we show that for n points in convex position the achromatic index and the pseudoachromatic index of the complete geometric graph are \(\lfloor \frac{n^2+n}{4} \rfloor \). 相似文献
4.
O. Aichholzer F. Aurenhammer Siu-Wing Cheng N. Katoh G. Rote M. Taschwer Yin-Feng Xu 《Discrete and Computational Geometry》1996,16(4):339-359
We show that there is a matching between the edges of any two triangulations of a planar point set such that an edge of one triangulation is matched either to the identical edge in the other triangulation or to an edge that crosses it. This theorem also holds for the triangles of the triangulations and in general independence systems. As an application, we give some lower bounds for the minimum-weight triangulation which can be computed in polynomial time by matching and network-flow techniques. We exhibit an easy-to-recognize class of point sets for which the minimum-weight triangulation coincides with the greedy triangulation. 相似文献
5.
Oswin Aichholzer Franz Aurenhammer Thomas Hackl Bettina Speckmann 《Computational Geometry》2009,42(6-7):627-631
In this note we discuss some structural properties of minimum weight pseudo-triangulations of point sets. 相似文献
6.
7.
Oswin Aichholzer Ruy Fabila-Monroy Thomas Hackl Clemens Huemer Jorge Urrutia 《Discrete and Computational Geometry》2014,51(2):362-393
Let S be a k-colored (finite) set of n points in $\mathbb{R}^{d}$ , d≥3, in general position, that is, no (d+1) points of S lie in a common (d?1)-dimensional hyperplane. We count the number of empty monochromatic d-simplices determined by S, that is, simplices which have only points from one color class of S as vertices and no points of S in their interior. For 3≤k≤d we provide a lower bound of $\varOmega(n^{d-k+1+2^{-d}})$ and strengthen this to Ω(n d?2/3) for k=2. On the way we provide various results on triangulations of point sets in $\mathbb{R}^{d}$ . In particular, for any constant dimension d≥3, we prove that every set of n points (n sufficiently large), in general position in $\mathbb{R}^{d}$ , admits a triangulation with at least dn+Ω(logn) simplices. 相似文献
8.
We study the following Ramsey-type problem. Let S=B∪R be a two-colored set of n points in the plane. We show how to construct, in time, a crossing-free spanning tree T(B) for B, and a crossing-free spanning tree T(R) for R, such that both the number of crossings between T(B) and T(R) and the diameters of T(B) and T(R) are kept small. The algorithm is conceptually simple and is implementable without using any non-trivial data structure. This improves over a previous method in Tokunaga [Intersection number of two connected geometric graphs, Inform. Process. Lett. 59 (1996) 331-333] that is less efficient in implementation and does not guarantee a diameter bound. Implicit to our approach is a new proof for the result in the reference above on the minimum number of crossings between T(B) and T(R). 相似文献
9.
10.