Titlebook: Algorithm Theory - SWAT ‘94; 4th Scandianvian Wor Erik M. Schmidt,Sven Skyum Conference proceedings 1994 Springer-Verlag Berlin Heidelberg

發(fā)源

Inertia

nutrition

New results on binary space partitions in the plane (extended abstract),actical situations. In particular, we construct linear size binary space partitions for sets of fat objects, for sets of line segments where the ratio between the lengths of the longest and shortest segment is bounded by a constant, and for homothetic objects. For all cases we also show how to turn

不出名

A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon, log ./ log .) processors in the CRCW PRAM model. The concurrent write is used only by an integer sorting subroutine. We also obtain an .(log .)-time and . log log ./ log .)-processor CRCW PRAM algorithm for the construction of the medial axis of a convex polygon. Our algorithms use the solution to

chapel

On triangulating planar graphs under the four-connectivity constraint, from the areas of graph algorithms and computational geometry. In this paper we consider the triangulation problem for planar graphs under the constraint that four-connectivity has to be satisfied..Our first result states that triangulating embedded planar graphs without introducing new separating

中止

Parallel and sequential approximation of shortest superstrings,In this paper we examine the complexity of approximating a shortest superstring. There are two basic measures of the approximations: the compression ratio and the approximation ratio. The well known and practical approximation algorithm is the sequential algorithm GREEDY. It approximates the shortes

固定某物