123 search results - page 11 / 25 » Simultaneous Geometric Graph Embeddings |
WADS
2005
Springer
14 years 25 days ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
SPAA
2005
ACM
14 years 27 days ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
An algorithm is presented for the geometric analysis of an algebraic curve f(x, y) = 0 in the real affine plane. It computes a cylindrical algebraic decomposition (CAD) of the pla...
PR
2007
13 years 6 months ago
2007
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a patte...
WWW
2010
ACM
14 years 2 months ago
2010
ACM
With the explosive growth of digital cameras and online media, it has become crucial to design efficient methods that help users browse and search large image collections. The rec...