115 search results - page 15 / 23 » Refolding planar polygons |
COMGEO
2008
ACM
13 years 7 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonove...
IROS
2008
IEEE
14 years 1 months ago
2008
IEEE
— This paper addresses the problem of generating dynamic motion for a humanoid between two predefined postures. The humanoid robot starts its motion from a statically stable con...
COMPUTING
2007
13 years 7 months ago
2007
We present a multiresolution morphing algorithm using “as-rigid-as-possible” shape interpolation combinedwithanangle-lengthbasedmultiresolutiondecompositionofsimple2Dpiecewise...
VISUALIZATION
1997
IEEE
13 years 11 months ago
1997
IEEE
: We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function f...