Titlebook: Computing and Combinatorics; 7th Annual Internati Jie Wang Conference proceedings 2001 Springer-Verlag Berlin Heidelberg 2001 Graph.Graph t

brother

Towards Compatible Triangulationsnner, i.e., such that the resulting two planar graphs are isomorphic. The conjecture is proved true for point sets with at most three interior points. We further exhibit a class of point sets which can be triangulated compatibly with any other set (that satis?es the obvious size and hull restriction

Exploit

An Improved Upper Bound on the Size of Planar Convex-Hullse diameter of .: i.e. the maximum distance between any pair of points in .. It has been shown that . = 7.559.. for an arbitrary ., and . = 3.496.. in the special case when . is a ball centered at the origin in the plane. In this paper we show that . = 12/ 3v 4p2 = 3.524.. is sufficient for an arbitr

ADAGE

結束

Estimable

一起平行

Maximum Red/Blue Interval Matching with Application, such that a pair of intervals in . can be matched only if they overlap with each other and have different colors. This problem arises in some applications such as radiosurgery treatment planning. We present a greedy algorithm for this problem that runs in .(. log log .) time for sorted input.We al

暫時別動

Computing Farthest Neighbors on a Convex Polytopeection .(.) of the diagram with the boundary of the convex hull of .. We give an algorithm that computes an implicit representation of .(.) in expected .(. log..) time. More precisely, we compute the combinatorial structure of .(.), the coordinates of its vertices, and the equation of the plane de?n

辯論的終結

dictator

Capitulate