1009 search results - page 107 / 202 » On Indexing Line Segments |
SIBGRAPI
2003
IEEE
14 years 3 months ago
2003
IEEE
The classical Douglas-Peucker line-simplification algorithm is recognized as the one that delivers the best perceptual representations of the original lines. It is used extensivel...
FOCS
1999
IEEE
14 years 2 months ago
1999
IEEE
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
STOC
1995
ACM
14 years 1 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
DMIN
2006
13 years 11 months ago
2006
: Temporal data mining is concerned with the analysis of temporal data and finding temporal patterns, regularities, trends, clusters in sets of temporal data. Wavelet transform pro...
AAAI
1998
13 years 11 months ago
1998
A Messy Genetic Algorithm is customized toflnd'optimal many-to-many matches for 2D line segment models. The Messy GA is a variant upon the Standard Genetic Algorithm in which...