Point sets containing their triangle centers

Let S be a set of at least five points in the plane, not all on a line. Suppose that for any three points $${a,b,c\in S}$$ the nine-point center of triangle abc also belongs to S. We show that S must be dense in the plane. We also consider several problems about partitioning the plane into two sets containing their triangle center

Dilation, Transport, Visibility and Fault-Tolerant Algorithms

Connecting some points in the plane by a road network is equivalent to constructing a finite planar graph G whose vertex set contains a predefined set of vertices (i. e., the possible destinations in the road network). The dilation between two vertices p and q of graph G is defined as the Euclidean length of a shortest path in G from p to q, divided by the Euclidean distance from p to q. That is, given a point set P, the goal is to place some additional crossing vertices C such that there exists a planar graph G = (P ∪ C, E) whose dilation is small. Here, the dilation of G is defined as the maximum dilation between two vertices in G. We show that, except for some special point sets P, there is a lower bound Δ(P) > 1, depending on P, on the dilation of any finite graph containing P in its vertex set. The transportation problem is the problem of finding a transportation plan that minimizes the total transport cost. We are given a set of suppliers, and each supplier produces a fixed amount of some commodity, say, bread. Furthermore, there is a set of customers, and each customer has some demand of bread, such that the total demand equals the amount of bread the suppliers produce. The task is to assign each unit of bread produced to some customer, such that the total transportation cost becomes a minimum. A first idea is to assign each unit of bread to the client to which the transport cost of this unit is minimal. Clearly, this gives rise to a transportation plan which minimizes the total transportation cost. However, it is likely that not every customer will obtain the required amount of bread. Therefore, we need to use a different algorithm for distributing the supplier's bread. We show that if the bread produced by the suppliers is given by a continuous probability density function and the set of customers is discrete, then every optimal transport plan can be characterized by a unique additively weighted Voronoi diagram for the customers. When managing the construction process of a building by a digital model of the building, it is necessary to compute essential parts between walls of the building. Given two walls A and B, the essential part between A and B is the set of line segments s where one endpoint belongs to A, the other endpoint belongs to B, and s does not intersect A or B. We give an algorithm that computes, in linear time, the essential parts between A and B. Our algorithm is based on computing the visibility polygon of A and of B, and two shortest paths connecting points of A with points of B. We conclude the thesis by giving fault-tolerant algorithms for some fundamental geometric problems. We assume that a basic primitive operation used by an algorithm fails with some small probability p. Depending on the results of the primitive operations, it is possible that the algorithm will not work correctly. For example, one faulty comparison when executing a sorting algorithm can result in some numbers being placed far away from their true positions. An algorithm is called tolerant, if with high probability a good answer is given, if the error probability p is small. We provide tolerant algorithms that find the maximum of n numbers, search for a key in a sorted sequence of n keys, sort a set of n numbers, and solve Linear Programming in R2

On the Density of Iterated Line Segment Intersections

Given S1, a finite set of points in the plane, we define a sequence of point sets Si as follows: With Si already determined, let Li be the set of all the line segments connecting pairs of points of Si j=1 Sj, and let Si+1 be the set of intersection points of those line segments in Li, which cross but do not overlap. We show that with the exception of some starting configurations the set of all crossing points S∞ i=1 Si is dense in a particular subset of the plane with nonempty interior. This region is the intersection of all closed half planes which contain all but at most one point from S1