2064 search results - page 300 / 413 » Segmentation Problems |
155
click to vote
ICRA
2006
IEEE
16 years 11 days ago
2006
IEEE
— Most work on the simultaneous localization and mapping (SLAM) problem assumes the frequent availability of dense information about the environment such as that provided by a la...
153
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
144
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
153
click to vote
GD
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic drawing convention. It requires that edges are drawn as interior-disjoint monotone chains o...
171
click to vote
EUROCOLT
1995
Springer
15 years 10 months ago
1995
Springer
k. The model we study can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting. We show that the multi...