477 search results - page 3 / 96 » Removing even crossings |
ICCAD
2005
IEEE
14 years 1 months ago
2005
IEEE
— When exploring computing elements made from technologies other than CMOS, it is imperative to investigate the effects of physical implementation constraints. This paper focuses...
SODA
2003
ACM
13 years 6 months ago
2003
ACM
Though Delaunay triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional Delaunay triangulation is still ...
IWPC
2008
IEEE
13 years 11 months ago
2008
IEEE
Many program comprehension tools use graphs to visualize and analyze source code. The main issue is that existing approaches create graphs overloaded with too much information. Gr...
SMILE
1998
Springer
13 years 9 months ago
1998
Springer
As virtual worlds demand ever more realistic 3D models, attention is being focussed on systems that can acquire graphical models from real objects. This paper describes a system wh...
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...