Sciweavers

450 search results - page 29 / 90
» Quadrangulations of Planar Sets
Sort
View
COMPGEOM
2006
ACM
14 years 3 months ago
Refolding planar polygons
Abstract This paper describes an algorithm for generating a guaranteed intersectionfree interpolation sequence between any pair of compatible polygons. Our algorithm builds on prio...
Hayley N. Iben, James F. O'Brien, Erik D. Demaine
ICRA
2003
IEEE
91views Robotics» more  ICRA 2003»
14 years 2 months ago
Visual registration and navigation using planar features
— This paper addresses the problem of registering the hexapedal robot, RHex, relative to a known set of beacons, by real-time visual servoing. A suitably constructed navigation f...
Gabriel A. D. Lopes, Daniel E. Koditschek
ICVGIP
2008
13 years 10 months ago
Frequency Domain Visual Servoing Using Planar Contours
Fourier domain methods have had a long association with geometric vision. In this paper, we introduce Fourier domain methods into the field of visual servoing for the first time. ...
Visesh Chari, Avinash Sharma, Anoop M. Namboodiri,...
IJIG
2008
222views more  IJIG 2008»
13 years 9 months ago
An Analytical Solution to the Perspective-n-Point Problem for Common Planar Camera and for Catadioptric Sensor
The Perspective-N-Point problem (PNP) is a notable problem in computer vision. It consists in, given N points known in an object coordinate space and their projection onto the ima...
Jonathan Fabrizio, Jean Devars
IVC
2000
113views more  IVC 2000»
13 years 9 months ago
Matching disparate views of planar surfaces using projective invariants
Feature matching is a prerequisite to a wide variety of vision tasks. This paper presents a method that addresses the problem of matching disparate views of coplanar points and li...
Manolis I. A. Lourakis, Spyros T. Halkidis, Stelio...