650 search results - page 125 / 130 » Generalized Self-Approaching Curves |
IUI
2004
ACM
14 years 24 days ago
2004
ACM
Analysis of sketched digital ink is often aided by the division of stroke points into perceptually-salient fragments based on geometric features. Fragmentation has many applicatio...
CRYPTO
2004
Springer
14 years 23 days ago
2004
Springer
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expens...
COMPGEOM
2003
ACM
14 years 19 days ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
SMA
2003
ACM
14 years 19 days ago
2003
ACM
This paper presents a new method to compute constructive solid geometry (CSG) tree representations of an object whose faces consist of planar and non-planar surfaces. The algorith...
SMA
2003
ACM
14 years 19 days ago
2003
ACM
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...