Topic
Distance transform
About: Distance transform is a research topic. Over the lifetime, 2886 publications have been published within this topic receiving 59481 citations.
Papers published on a yearly basis
Papers
More filters
01 Jan 2003
TL;DR: The problem of rapid distance computation between rigid objects and highly deformable objects, which is important in the context of physically based modeling of e.g hair or clothing, is addressed and a simple but fast algorithm for partial distance field computation is proposed.
Abstract: In this paper we address the problem of rapid distance computation between rigid objects and highly deformable objects, which is important in the context of physically based modeling of e.g hair or clothing. Our method is in particular useful when modeling deformable objects with particle systems—the most common approach to simulate such objects. We combine some already known techniques about distance fields into an algorithm for rapid collision detection. Only the rigid objects of an environment are represented by distance fields. In the context of proximity queries, which are essential for proper collision detection, this representation has two main advantages: First, any given boundary representation can be approximated quite easily, no high-degree polynomials or complicated approximation algorithms are needed. Second, the evaluation of distances and normals needed for collision response is extremely fast and independent of the complexity of the object. In the course of the paper we propose a simple, but fast algorithm for partial distance field computation. The sources are triangular meshes. Then, we present our approach for collision detection in detail. Examples from an interactive cloth animation system show the advantages of our approach in practice. We conclude that our method allows real-time animations of complex deformable objects in non-trivial environments on standard PC hardware.
105 citations
TL;DR: This paper designs and implements a novel graph-based min-cut/max-flow algorithm that incorporates topology priors as global constraints and introduces a label attribute for each node to explicitly handle the topology constraints.
105 citations
TL;DR: This work uses the logarithm of the odds ratio (LogOdds) to place probabilistic atlases in a linear vector space and finds that the LogOdds approach better preserves shapes in a complex multiple object setting.
104 citations
TL;DR: A simple and efficient algorithm using the maxima tracking approach on Euclidean distance transform to detect skeleton points is presented and can be modified to eliminate non-significant short skeletal branches originating from the object contour while the critical shape-informative medial axes are preserved.
104 citations
TL;DR: In this article, a distance transformation technique for a binary digital image using a gray-scale mathematical morphology approach is presented, which can significantly reduce the tremendous cost of global operations to that of small neighborhood operations suitable for parallel pipelined computers.
Abstract: A distance transformation technique for a binary digital image using a gray-scale mathematical morphology approach is presented. Applying well-developed decomposition properties of mathematical morphology, one can significantly reduce the tremendous cost of global operations to that of small neighborhood operations suitable for parallel pipelined computers. First, the distance transformation using mathematical morphology is developed. Then several approximations of the Euclidean distance are discussed. The decomposition of the Euclidean distance structuring element is presented. The decomposition technique employs a set of 3 by 3 gray scale morphological erosions with suitable weighted structuring elements and combines the outputs using the minimum operator. Real-valued distance transformations are considered during the processes and the result is approximated to the closest integer in the final output image. >
103 citations