The use of an alphabet of line segments to compose a curve is a possible approach for curve data compression. An existing state-of-the-art method considers a quadtree decompositio...
Abstract. This paper describes an algorithm for generating unstructured triangulations for arbitrarily shaped twodimensional regions. The algorithm works for regions without cracks...
Antonio C. O. Miranda, Joaquim B. Cavalcante Neto,...
We present an efficient algorithm called the Quadtree Heuristic for identifying a list of similar terms for each unique term in a large document collection. Term similarity is de...
abstract Dzung T. Hoang Philip M. Longy Je rey Scott Vitterz Department of Computer Science Duke University Box 90129 Durham, NC 27708 0129 We compare methods for choosing motion ...
Dzung T. Hoang, Philip M. Long, Jeffrey Scott Vitt...
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...