553 search results - page 27 / 111 » On Planar Path Transformation |
COMPGEOM
2006
ACM
14 years 3 months ago
2006
ACM
Abstract This paper describes an algorithm for generating a guaranteed intersectionfree interpolation sequence between any pair of compatible polygons. Our algorithm builds on prio...
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
The concept of virtual holonomic constraints is extended to the case of double support, which is characterized by a closed kinematic chain and redundancy in the state variables. An...
SODA
1990
ACM
13 years 11 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
DIALM
2003
ACM
14 years 3 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We propose new robust classification algorithms for planar and spatial curves subjected to affine transformations. Our motivation comes from the problems in computer image recognit...