1879 search results - page 153 / 376 » Computational geometry algorithms library |
137
click to vote
DGCI
2006
Springer
15 years 8 months ago
2006
Springer
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...
126
click to vote
COMPGEOM
1994
ACM
15 years 8 months ago
1994
ACM
We devise techniques to manipulate a collection of loosely interpenetrating spheres in threedimensional space. Our study is motivated by the representation and manipulation of mol...
128
Voted
TOG
2002
15 years 4 months ago
2002
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold ...
146
Voted
DGCI
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisel...
150
click to vote
COMPGEOM
2008
ACM
15 years 6 months ago
2008
ACM
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...