42 search results - page 6 / 9 » compgeom 2009 |
130
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
149
Voted
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
We demonstrate how the scale axis transform can be used to compute a parameterized family of shape skeletons. The skeletons gradually represent only the most important features of...
132
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
109
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
A topological graph is a graph drawn in the plane with vertices represented by points and edges as arcs connecting its vertices. A k-grid in a topological graph is a pair of edge ...
125
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to nd a minimum cardinality subse...