14548 search results - page 2513 / 2910 » The Optimal Path-Matching Problem |
228
click to vote
PVG
2003
IEEE
16 years 1 days ago
2003
IEEE
Parallel volume rendering offers a feasible solution to the large data visualization problem by distributing both the data and rendering calculations among multiple computers con...
179
click to vote
PODC
2003
ACM
16 years 1 days ago
2003
ACM
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
179
click to vote
GD
2003
Springer
16 years 8 hour ago
2003
Springer
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
186
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
235
click to vote
DEM
2001
Springer
15 years 11 months ago
2001
Springer
A common concern of the real−time terrain visualisation of today is the lack of geometric detail, when the terrain model is studied close enough. This is primary not a problem of...