Sciweavers

13 search results - page 2 / 3
» Independent Set of Intersection Graphs of Convex Objects in ...
Sort
View

Publication
1500views
16 years 11 months ago
Robust Centerline Extraction Framework Using Level Sets
In this paper, we present a novel framework for computing centerlines for both 2D and 3D shape analysis. The framework works as follows: an object centerline point is selected aut...
M. Sabry Hassouna, Aly A. Farag

Presentation
3660views
16 years 11 months ago
Robust Centerline Extraction Framework Using Level Sets
In this paper, we present a novel framework for computing centerlines for both 2D and 3D shape analysis. The framework works as follows: an object centerline point is selected auto...
M. Sabry Hassouna
DAGSTUHL
2006
15 years 1 days ago
Many-to-Many Feature Matching in Object Recognition
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
Ali Shokoufandeh, Yakov Keselman, M. Fatih Demirci...
ICALP
2009
Springer
15 years 11 months ago
Elimination Graphs
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
Yuli Ye, Allan Borodin
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
15 years 5 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani