CAD
2002
Springer
13 years 9 months ago
2002
Springer
This paper presents an algorithm for extending B-spline curves and surfaces. Based on the unclamping algorithm for B-spline curves, we propose a new algorithm for extending B-spli...
CAGD
2000
13 years 9 months ago
2000
Multi-point machining (MPM) is a tool positioning technique used for finish machining of sculptured surfaces. In this technique the desired surface is generated at more than one p...
ALGORITHMICA
2000
13 years 9 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
CVIU
2004
13 years 9 months ago
2004
Consider a binary image containing one or more objects. A signed distance transform assigns to each pixel (voxel, etc.), both inside and outside of any objects, the minimum distan...
CVGIP
2004
13 years 9 months ago
2004
This paper presents a surface reconstruction algorithm that can recover correct shape geometry as well as its unknown topology from both volumetric images and unorganized point cl...
CSUR
2004
13 years 9 months ago
2004
Bresenham's algorithm minimizes error in drawing lines on integer grid points; leap year calculations, surprisingly, are a generalization. We compare the two calculations, exp...
CSL
2004
Springer
13 years 9 months ago
2004
Springer
This article describes an algorithm called HyperLex that is capable of automatically determining word uses in a textbase without recourse to a dictionary. The algorithm makes use ...
CSDA
2004
13 years 9 months ago
2004
We present an algorithm for computing the probability density function of the product of two independent random variables, along with an implementation of the algorithm in a compu...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
We propose a new GCD algorithm called Accelerated Euclidean Algorithm, or AEA for short, which matches the O(n log2 n log log n) time complexity of the Sch
CORR
2004
Springer
13 years 9 months ago
2004
Springer
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...