205 search results - page 8 / 41 » Engineering Planar Separator Algorithms |
ECCV
2004
Springer
15 years 11 months ago
2004
Springer
In the present paper, we address the problem of recovering the true underlying model of a surface while performing the segmentation. A novel criterion for surface (model) selection...
97
Voted
COCOON
1999
Springer
15 years 1 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
ESA
1999
Springer
15 years 1 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
FSTTCS
2004
Springer
15 years 2 months ago
2004
Springer
When studying a 3D polyhedron, it is often easier to cut it open and
atten in on the plane. There are several ways to perform this unfolding. Standard unfoldings which have been u...
IROS
2007
IEEE
15 years 3 months ago
2007
IEEE
— Two novel methods for computing 3D structure information from video for a piecewise planar scene are presented. The first method is based on a new line constraint, which clear...