Titlebook: Algorithms and Computation; 7th International Sy Tetsuo Asano,Yoshihide Igarashi,Subhash Suri Conference proceedings 1996 Springer-Verlag B

警告

Incremental convex hull algorithms are not output sensitive, (extreme points) .. The . problem is to convert from the vertex representation to the halfspace representation or (equivalently by geometric duality) vice-versa. Given an ordering .. ... .. of the input vertices, after some initialization an incremental convex hull algorithm constructs halfspace de

coltish

Separating and shattering long line segments,s of .. A set . of lines is said to . if each line of . is a separator for ., and every two objects of . are separated by at least one line of .. We give a simple algorithm to construct the set of all separators for a given set . of . line segments in time .(. log .), provided the ratio between the

nephritis

GEAR

Interval finding and its application to data mining,}. Consider an objective function ., conditional functions ..(I) on ., and define an optimization problem of finding the interval . maximizing . subject to ..(I) > .. for given real numbers .. (i=1, 2,., .). We propose efficient algorithms to solve the above optimization problem if the objective fun

euphoria

fender

得罪人

Two-dimensional dynamic dictionary matching,ching for all occurrences of the patterns in a given text. The dictionary has to be updated efficiently when a pattern is inserted or deleted. The contribution of this paper is an improvement to the existing suffix-tree based solution [Gi93] as regards both the update and search algorithms. In compa