127 search results - page 14 / 26 » The Directed Planar Reachability Problem |
IJCAI
2003
13 years 11 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
ICRA
2008
IEEE
14 years 4 months ago
2008
IEEE
— In this paper, we describe the components of a novel algorithm for the extraction of dominant orthogonal planar structures from monocular images taken in indoor environments. T...
GMP
2006
IEEE
14 years 3 months ago
2006
IEEE
Abstract. We present an efficient and robust algorithm for computing continuous visibility for two- or three-dimensional shapes whose boundaries are NURBS curves or surfaces by li...
SMI
2008
IEEE
14 years 4 months ago
2008
IEEE
In this paper we present a new method for alignment of 3D models. This approach is based on symmetry properties, and uses the fact that the principal components analysis (PCA) hav...
COMPGEOM
2001
ACM
14 years 1 months ago
2001
ACM
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...