Sciweavers

1009 search results - page 2 / 202
» On Indexing Line Segments
Sort
View
SSDBM
2007
IEEE
111views Database» more  SSDBM 2007»
13 years 11 months ago
Duplicate Elimination in Space-partitioning Tree Indexes
Space-partitioning trees, like the disk-based trie, quadtree, kd-tree and their variants, are a family of access methods that index multi-dimensional objects. In the case of index...
Mohamed Y. Eltabakh, Mourad Ouzzani, Walid G. Aref
ICDAR
2007
IEEE
13 years 11 months ago
An Efficient Word Segmentation Technique for Historical and Degraded Machine-Printed Documents
Word segmentation is a crucial step for segmentation-free document analysis systems and is used for creating an index based on word matching. In this paper, we propose a novel met...
Michael Makridis, N. Nikolaou, Basilios Gatos
GIS
2006
ACM
13 years 5 months ago
Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
Bart Kuijpers, Bart Moelans, Nico Van de Weghe
SSIAI
2002
IEEE
13 years 10 months ago
Matching Patterns of Line Segments by Eigenvector Decomposition
This paper presents an algorithm for matching line segments in two images which are related by an affine transformation. Images are represented as patterns of line segments. Areas...
H. B. Chan, Y. S. Hung
CCCG
2003
13 years 6 months ago
Transversals to line segments in R3
We completely describe the structure of the connected components of transversals to a collection of n arbitrary line segments in R3 . We show that n 3 line segments in R3 admit 0,...
Hervé Brönnimann, Hazel Everett, Sylva...