12 search results - page 3 / 3 » The approximate GCD of inexact polynomials |
PAMI
2006
13 years 5 months ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
COMGEO
2007
ACM
13 years 5 months ago
2007
ACM
In this paper we present a package for implementing exact kinetic data structures built on objects which move along polynomial trajectories. We discuss how the package design was ...