Titlebook: Algorithms and Data Structures; Workshop WADS ‘89, O F. Dehne,J. -R. Sack,N. Santoro Conference proceedings 1989 Springer-Verlag Berlin Hei

biosphere

bronchiole

Thyroid-Gland

支架

Computing the minimum visible vertex distance between two polygons,segment joining these vertices does not properly intersect any edge of these polygons. The problem of finding a closest visible pair of vertices requires finding two vertices, .∈. and .∈., that are visible to each other and that are closest to each other among all such pairs. In this paper, we prese

machination

synovium

Linear time algorithms for computing reachability regions from polygonal figures,e also define a . in the plane as being the compact set bounded by a Jordan curve. A . in the plane is defined as being a compact set containing .. A . is simply a solid figure or a nonsolid figure. In this paper, we study some properties of reachability regions from figures. We also present linear

口味

Weighted orthogonal linear ,,-approximation and applications,The algorithm is shown to require .(.log.) time and .(.) space for .=2, and .(..) time and .(..) space for .>2. The ..-approximation algorithm will be adapted to solve the problem of finding the width of a set of . points in .., and the problem of finding a stabbing hyperplane for a set of . hypersp

Transfusion

Coeval