123 search results - page 15 / 25 » Enumerating Triangulation Paths |
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
FSTTCS
2000
Springer
13 years 11 months ago
2000
Springer
We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves th...
GLVLSI
2002
IEEE
14 years 10 days ago
2002
IEEE
This paper develops new techniques for detecting both stuck-open faults and resistive open faults, which result in increased delays along some paths. The improved detection of CMO...
COCOON
1999
Springer
13 years 11 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...
SMI
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper, we propose to address the semanticoriented 3D mesh hierarchical segmentation problem, using enhanced topological skeletons [18]. This high level information drives ...