115 search results - page 16 / 23 » Refolding planar polygons |
CVPR
2001
IEEE
14 years 9 months ago
2001
IEEE
We present a system for modeling buildings from a single correlation-based Digital Elevation Model (DEM). The model is constructed in two stages. The first stage segments the DEM ...
ICML
2001
IEEE
14 years 8 months ago
2001
IEEE
This paper describes an algorithm for generating compact 3D models of indoor environments with mobile robots. Our algorithm employs the expectation maximization algorithm to fit a...
SWAT
2000
Springer
13 years 11 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
ICRA
1994
IEEE
13 years 11 months ago
1994
IEEE
While most previous work in planning manipulation tasks relies on the assumption of quasi-static conditions, there can be situations where the quasi-static assumption may not hold...
COMPGEOM
2004
ACM
14 years 24 days ago
2004
ACM
We present a new algorithm for unfolding planar polygonal linkages without self-intersection based on following the gradient flow of a “repulsive” energy function. This algor...