Sciweavers

30 search results - page 3 / 6
» On the Geometric Dilation of Finite Point Sets
Sort
View
STOC
2004
ACM
88views Algorithms» more  STOC 2004»
15 years 12 months ago
Expander flows, geometric embeddings and graph partitioning
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
Sanjeev Arora, Satish Rao, Umesh V. Vazirani
IFIP
1998
Springer
15 years 3 months ago
One Sided Error Predicates in Geometric Computing
A conservative implementation of a predicate returns true only if the exact predicate is true. That is, we accept a one sided error for the implementation. For geometric predicate...
Lutz Kettner, Emo Welzl
MICCAI
2003
Springer
16 years 17 days ago
Relative Performance of Geometric Search Algorithms for Interpolating Unstructured Mesh Data
Abstract. Interpolation of field data from unstructured meshes requires the potentially expensive identification of the finite element or volume within which the interpolating poin...
Mahdieh Khoshniat, Gordan R. Stuhne, David A. Stei...
STOC
2003
ACM
136views Algorithms» more  STOC 2003»
15 years 12 months ago
Alpha-shapes and flow shapes are homotopy equivalent
In this paper we establish a topological similarity between two apparently different shape constructors from a set of points. Shape constructors are geometric structures that tran...
Tamal K. Dey, Joachim Giesen, Matthias John
ECCV
2004
Springer
16 years 1 months ago
Morphological Operations on Matrix-Valued Images
The output of modern imaging techniques such as diffusion tensor MRI or the physical measurement of anisotropic behaviour in materials such as the stress-tensor consists of tensor-...
Bernhard Burgeth, Martin Welk, Christian Feddern, ...