361 search results - page 13 / 73 » Algorithms for Extracting Timeliness Graphs |
CAD
2007
Springer
13 years 8 months ago
2007
Springer
The reconstruction of a surface model from a point cloud is an important task in the reverse engineering of industrial parts. We aim at constructing a curve network on the point c...
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract - This paper presents an improvement over a previous contour closure algorithm. Assuming that edge points are given as input, the proposed approach consists of two steps. ...
ICPP
2009
IEEE
13 years 6 months ago
2009
IEEE
In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that ...
ESOP
2010
Springer
14 years 6 months ago
2010
Springer
Iterated Register Coalescing (IRC) is a widely used heuristic for performing register allocation via graph coloring. Many implementations in existing compilers follow (more or less...
ACCV
2009
Springer
14 years 3 months ago
2009
Springer
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...