3690 search results - page 65 / 738 » Computation with classical sequents |
IWVF
2001
Springer
15 years 2 months ago
2001
Springer
ÐA voxel-based method for flattening a surface in 3D space into 2D while best preserving distances is presented. Triangulation or polyhedral approximation of the voxel data are no...
DGCI
2008
Springer
14 years 11 months ago
2008
Springer
Based on a classical convex hull algorithm called Gift-Wrapping, the purpose of the paper is to provide a new algorithm for computing the vertices of a polytope called preimage - ...
MVA
1996
14 years 11 months ago
1996
This paper presents an original algorithm for the computation of optical ow called Orthogonal Dynamic Programming (ODP) as well as several enhancements to it. The principle is to ...
HAPTICS
2010
IEEE
14 years 10 months ago
2010
IEEE
Limitations of state-of-the-art teleoperation systems can be compensated by using shared-control teleoperation architectures that provide haptic assistance to the human operator. T...
ALGORITHMICA
2004
14 years 9 months ago
2004
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...