138 search results - page 5 / 28 » Efficient Expected-Case Algorithms for Planar Point Location |
BMCBI
2010
13 years 7 months ago
2010
Background: Graph drawing is one of the important techniques for understanding biological regulations in a cell or among cells at the pathway level. Among many available layout al...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Efficient view registration with respect to a given 3D reconstruction
has many applications like inside-out tracking
in indoor and outdoor environments, and geo-locating images
...
CAGD
2008
13 years 7 months ago
2008
We describe a new subdivision method to efficiently compute the topology and the arrangement of implicit planar curves. We emphasize that the output topology and arrangement are g...
CRV
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper considers the problem of shape-from-shading using nearby planar distributed illuminants. It is shown that a rectangular planar nearby distributed uniform isotropic illu...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...