53 search results - page 3 / 11 » Efficient Algorithms for Approximating Polygonal Chains |
IPPS
1994
IEEE
13 years 11 months ago
1994
IEEE
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
CGI
2004
IEEE
13 years 11 months ago
2004
IEEE
We present a new algorithm for computing a polygonal surface from a union of balls. The method computes and connects the singular points of a given union of balls in an efficient ...
DIMACS
2001
13 years 9 months ago
2001
Abstract. One-degree-of-freedom mechanisms induced by minimum pseudotriangulations with one convex hull edge removed have been recently introduced by the author to solve a family o...
TIP
1998
13 years 7 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
COMPGEOM
2000
ACM
13 years 12 months ago
2000
ACM
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...