31 search results - page 3 / 7 » Piecewise Linear Approximation of Signed Distance Fields |
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
Tutorial
An easy to follow tutorial that covers the implementation details of the Narrow Band Level Set Method. It also covers the numerical approximation for PDEs governing different types...
FOCS
1992
IEEE
13 years 9 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
SMA
2003
ACM
13 years 10 months ago
2003
ACM
We present a method to estimate the in/out function of a closed surface represented by an unorganized set of data points. From the in/out function, we compute an approximation of ...
VLSISP
2010
13 years 3 months ago
2010
— This paper presents ALA (Adaptable Logarithm Approximation), a novel hardware architecture for the approximation of the base-2 logarithm of integers at an arbitrary accuracy, s...