144
click to vote
COMGEO
13 years 8 months ago
2012 ACM 
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
142
click to vote
COMGEO
13 years 8 months ago
2012 ACM 
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
124
Voted
COMGEO
13 years 8 months ago
2012 ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
131
Voted
COMGEO
13 years 8 months ago
2012 ACM 
The problem of reconstructing a region from a set of sample points is common in many geometric applications, including computer vision. It is very helpful to be able to guarantee ...
|
Applied Computing