Sciweavers

824 search results - page 1 / 165
» Efficient Distance Computation Between Non-Convex Objects
Sort
View
ICRA
1994
IEEE
98views Robotics» more  ICRA 1994»
13 years 9 months ago
Efficient Distance Computation Between Non-Convex Objects
This paper describes an efficient algorithm for computing the distance between non-convex objects. Objects are modeled as the union of a set of convex components. From this model ...
Sean Quinlan
GMP
2000
IEEE
117views Solid Modeling» more  GMP 2000»
13 years 9 months ago
Distance Computation between Non-Convex Polyhedra at Short Range Based on Discrete Voronoi Regions
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between...
Katsuaki Kawachi, Hiromasa Suzuki
IJCGA
2008
179views more  IJCGA 2008»
13 years 5 months ago
Computing the Hausdorff Distance between Curved Objects
The Hausdorff distance between two sets of curves is a measure for the similarity of these objects and therefore an interesting feature in shape recognition. If the curves are alg...
Helmut Alt, Ludmila Scharf
JCB
2006
115views more  JCB 2006»
13 years 5 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger
IWFM
2003
172views Formal Methods» more  IWFM 2003»
13 years 6 months ago
On Continuous Models of Computation: Towards Computing the Distance Between (Logic) Programs
We present a report on work in progress on certain aspects of a programme of research concerned with building formal, mathematical models both for aspects of the computational pro...
Anthony Karel Seda, Máire Lane