2877 search results - page 7 / 576 » The Complexity of Planarity Testing |
PAMI
2011
12 years 9 months ago
2011
—3D object reconstruction from a single 2D line drawing is an important problem in computer vision. Many methods have been presented to solve this problem, but they usually fail ...
ICALP
2001
Springer
13 years 11 months ago
2001
Springer
CORR
1998
Springer
13 years 6 months ago
1998
Springer
ESA
2009
Springer
14 years 1 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
GD
1998
Springer
13 years 11 months ago
1998
Springer
We describe a unified framework of aesthetic criteria and complexity measures for drawing planar graphs with polylines and curves. This framework includes several visual properties...