Sciweavers

14347 search results - page 625 / 2870
» Interactive Granular Computing
Sort
View
VRST
2005
ACM
16 years 21 days ago
Computing inverse kinematics with linear programming
Inverse Kinematics (IK) is a popular technique for synthesizing motions of virtual characters. In this paper, we propose a Linear Programming based IK solver (LPIK) for interactiv...
Edmond S. L. Ho, Taku Komura, Rynson W. H. Lau
ICFEM
2005
Springer
16 years 20 days ago
Using Three-Valued Logic to Specify and Verify Algorithms of Computational Geometry
Many safety-critical systems deal with geometric objects. Reasoning about the correctness of such systems is mandatory and requires the use of basic definitions of geometry for th...
Jens Brandt, Klaus Schneider
IPSN
2005
Springer
16 years 19 days ago
Experiences and directions in pushpin computing
— Over the last three years we have built and experimented with the Pushpin Computing wireless sensor network platform. The Pushpin platform is a tabletop multihop wireless senso...
Joshua Lifton, Michael Broxton, Joseph A. Paradiso
ICCS
2003
Springer
16 years 10 days ago
Computational Science Simulations Based on Web Services
Abstract. We describe the software architecture of a system for doing multiphysics simulation of a coupled fluid, thermal, and mechanical fracture problem. The system is organized...
L. Paul Chew, Nikos Chrisochoides, S. Gopalsamy, G...
GMP
2000
IEEE
117views Solid Modeling» more  GMP 2000»
15 years 11 months ago
Distance Computation between Non-Convex Polyhedra at Short Range Based on Discrete Voronoi Regions
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between...
Katsuaki Kawachi, Hiromasa Suzuki