Titlebook: Algorithm Theory - SWAT‘98; 6th Scandinavian Wor Stefan Arnborg,Lars Ivansson Conference proceedings 1998 Springer-Verlag Berlin Heidelberg

harrow

An optimal algorithm for computing visible nearest foreign neighbors among colored line segments,t colors. A line segment . is a . of . if . is a nearest foreign neighbor of . in ., i.e. . and no segment with a color different from . is closer to . than ., and if there exist points . and . realizing the distance between . and . that are . for each other, i.e. the open segment connecting . and .