: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
We show how to compute the planar arrangement induced by segments of arbitrary algebraic curves with the Bentley-Ottmann sweep-line algorithm. The necessary geometric primitives r...
We outline PARI programs which assist with various algorithms related to descent via isogeny on elliptic curves. We describe, in this context, variations of standard inequalities w...
The focus of this paper is to design a spur gear using an S-shaped transition curve where certain conditions need to be fulfilled such as curvature continuity, shaped parameter etc...
Saifudin Hafiz Yahaya, Jamaludin Md Ali, Muhammad ...
This paper describes a new algorithm for geometric displacement mapping. Its key idea is that all occluded solutions for an eye ray lie in two-dimensional manifolds perpendicular ...