Sciweavers

736 search results - page 41 / 148
» Distinguishing geometric graphs
Sort
View
DGCI
2006
Springer
15 years 3 months ago
Topological and Geometrical Reconstruction of Complex Objects on Irregular Isothetic Grids
In this paper, we address the problem of vectorization of binary images on irregular isothetic grids. The representation of graphical elements by lines is common in document analys...
Antoine Vacavant, David Coeurjolly, Laure Tougne
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
15 years 3 months ago
Geometric lower bounds for parametric matroid optimization
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...
David Eppstein
IPCO
2004
114views Optimization» more  IPCO 2004»
15 years 1 months ago
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
SMI
2003
IEEE
172views Image Analysis» more  SMI 2003»
15 years 5 months ago
Skeleton Based Shape Matching and Retrieval
In this paper, we describe a novel method for searching and comparing 3D objects. The method encodes the geometric and topological information in the form of a skeletal graph and ...
H. Sundar, Deborah Silver, Nikhil Gagvani, Sven J....
SODA
2003
ACM
143views Algorithms» more  SODA 2003»
15 years 1 months ago
Matching planar maps
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic informati...
Helmut Alt, Alon Efrat, Günter Rote, Carola W...