Sciweavers

1009 search results - page 144 / 202
» On Indexing Line Segments
Sort
View
ICRA
1994
IEEE
111views Robotics» more  ICRA 1994»
14 years 1 months ago
From Spider Robots to Half Disk Robots
We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached...
Jean-Daniel Boissonnat, Olivier Devillers, Sylvain...
CBMS
2004
IEEE
14 years 20 days ago
Partial Shape Matching of Spine X-Ray Shapes Using Dynamic Programming
The osteophyte shows only on some particular locations on the vertebra. This indicates that other locations on the vertebra shape contain that are not of interest hinder the spine...
Xiaoqian Xu, D. J. Lee, Sameer Antani, L. Rodney L...
CIVR
2006
Springer
172views Image Analysis» more  CIVR 2006»
14 years 19 days ago
Retrieving Shapes Efficiently by a Qualitative Shape Descriptor: The Scope Histogram
Abstract. Efficient image retrieval from large image databases is a challenging problem. In this paper we present a method offering constant time complexity for the comparison of t...
Arne Schuldt, Björn Gottfried, Otthein Herzog
COMPGEOM
2010
ACM
14 years 7 days ago
Tangencies between families of disjoint regions in the plane
Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the memb...
János Pach, Andrew Suk, Miroslav Treml
FAW
2008
Springer
225views Algorithms» more  FAW 2008»
13 years 10 months ago
Versioning Tree Structures by Path-Merging
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
Khaireel A. Mohamed, Tobias Langner, Thomas Ottman...