In this paper, a thorough bottom-up optimization process (field, point and scalar arithmetic) is used to speed up the computation of elliptic curve point multiplication and report ...
We present a slicing-based coherence measure for clusters of DTI integral curves. For a given cluster, we probe samples from the cluster by slicing it with a plane at regularly spa...
We present a surface representation and a set of algorithms that allow interactive placement of curved parametric objects without interpenetration. Using these algorithms, a model...
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...
We consider the problem of computing stereo correspondence for scenes dense in physical structure, such as a bouquet of flowers. Boundaries are then space curves, formally govern...