450 search results - page 27 / 90 » Quadrangulations of Planar Sets |
CORR
2011
Springer
13 years 4 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
IROS
2006
IEEE
14 years 3 months ago
2006
IEEE
Abstract— We describe a model for planar distributed assembly, in which agents move randomly and independently on a twodimensional grid, joining square blocks together to form a ...
3DPVT
2004
IEEE
14 years 26 days ago
2004
IEEE
This paper presents a segmentation technique to decompose automatically a panoramic range image into a set of planar projections. It consists of three stages. Firstly, two orthogo...
BMVC
1998
13 years 10 months ago
1998
In this paper, we discuss a method for representing and matching planar curves. The technique is based on using calculations from concentric circles to represent each curve by two...
ESA
2010
Springer
13 years 10 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...