189 search results - page 9 / 38 » Graph-Theoretic Solutions to Computational Geometry Problems |
COMPGEOM
2003
ACM
14 years 22 days ago
2003
ACM
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
ACTAC
2006
13 years 7 months ago
2006
The surgery of fractured bones is often a very complex problem. That is the reason why it would be beneficial to create a geometric and mechanic model of the bones before surgical...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
We introduce a new approach to modelling gradient flows of contours and surfaces. While standard variational methods (e.g. level sets) compute local interface motion in a different...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...