On beta-skeleton as a Subgraph of the Minimum Weight Triangulation (2007)
Given a set S of n points in the plane, a triangulation is a maximal set of nonintersecting edges connecting the points in S. The weight of the triangulation is the sum of the lengths of the edges....
Kontrolle Projektbereich Diskrete, Diskrete Optimierung, Gunter Rote, Triangulations Intersect Nicely, Oswin Aichholzer, Oswin Aichholzer, ...
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...
On Stable Line Segments in Triangulations (2007)
Andranik Mirzaian, Cao An Wang, Yin-feng Xu
this paper appeared in the Proc. of the 8th Canadian Conference in Computational Geometry, Carleton University, Ottawa, Canada, pp. 62-67, August 1996.
On β-skeleton as a subgraph of the minimum weight triangulation (2001)
Given a set S of n points in the plane, a triangulation is a maximal set of non-intersecting edges connecting the points in S. The weight of the triangulation is the sum of the lengths of the edges....
New algorithms for two-label point labeling (2000)
Qin, Zhongping, Wolff, Alexander, Xu, Yin-Feng, Zhu, Binhai
Given a label shape L and a set of n points in the plane, the two-label point-labeling problem consists of placing 2n non-intersecting translated copies of L of maximum size such that each point...
Approximating Uniform Triangular Meshes in Polygons (Algorithm Engineering as a New Paradigm) (1999)
Aurenhammer, Franz, Katoh, Naoki, Ohsaki, Makoto, Xu, Yin-Feng
Triangulations Intersect Nicely (1996)
Oswin Aichholzer, Oswin Aichholzer, Franz Aurenhammer, Franz Aurenhammer, Günter Rote, Michael Taschwer, ...
We show that there is a matching between the edges of anytwo triangulations of a planar point set such that an edge of one triangulation is matched either to the identical edge in the other...
Constrained independence system and triangulations of planar point sets (1995)
We propose and study a new constrained independence system. We obtain a sequence of results, including a matching theorem for bases of the system and introducing a set of light elements which give a...
Triangulations Intersect Nicely (1995)
O. Aichholzer, F. Aurenhammer, Siu-wing Cheng, N. Katoh, G. Rote, ...
. 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...
Constant-Level Greedy Triangulations Approximate the MWT Well (1995)
Diskrete Optimierung, O. Aichholzer, F. Aurenhammer, G. Rote, Oswin Aichholzer, ...
The well-known greedy triangulation GT (S) of a finite point set S is obtained by inserting compatible edges in increasing length order, where an edge is compatible if it does not cross previously...
Constant-Level Greedy Triangulations Approximate the MWT Well (1995)
O. Aichholzer, F. Aurenhammer, G. Rote, Oswin Aichholzer, Franz Aurenhammer, ...
The well-known greedy triangulation GT #S# of a #nite point set S is obtained by inserting compatible edges in increasing length order, where an edge is compatible if it does not cross previously...
Constrained independence system and triangulations of planar point sets (1994)
We propose and study a new constrained independence system. We obtain a sequence of results, including a matching theorem for bases of the system and introducing a set of light elements which give a...