14 search results - page 3 / 3 » The Geometry of Linear Higher-Order Recursion |
JGO
2010
13 years 9 days ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
PG
2000
IEEE
13 years 10 months ago
2000
IEEE
The representation of moving geometry entities is an important issue in the fields of CAD/CAM and robotics motion design. We present a method to interpolate the moving frame homog...
CGF
2007
13 years 5 months ago
2007
We propose a mesh segmentation algorithm via recursive bisection where at each step, a sub-mesh embedded in 3D is first spectrally projected into the plane and then a contour is ...
CVGIP
2002
13 years 5 months ago
2002
The dual of a 2-manifold polygonal mesh without boundary is commonly defined as another mesh with the same topology (genus) but different connectivity (vertex-face incidence), in ...