Congruence, similarity and symmetries of geometric objects
Discrete & Computational Geometry - ACM Symposium on Computational Geometry, Waterloo
Sharp upper and lower bounds on the length of general Davenport-Schinzel Sequences
Journal of Combinatorial Theory Series A
Approximation of convex polygons
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Computing the minimum Hausdorff distance for point sets under translation
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
A natural metric for curves—computing the distance for polygonal chains and approximation algorithms
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Matching points into noise regions: combinatorial bounds and algorithms
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Applications of parametric searching in geometric optimization
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Measuring the resemblance of polygonal curves
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Matching shapes with a reference point
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Bounded boxes, Hausdorff distance, and a new proof of an interesting Helly-type theorem
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Printed circuit board simplification: simplifying subdivisions in practice
Proceedings of the eleventh annual symposium on Computational geometry
Improvements on bottleneck matching and related problems using geometry
Proceedings of the twelfth annual symposium on Computational geometry
Classical floorplanning harmful?
ISPD '00 Proceedings of the 2000 international symposium on Physical design
Approximate congruence in nearly linear time
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Tracking Multiple Moving Objects for Real-Time Robot Navigation
Autonomous Robots
Reliable and Efficient Pattern Matching Using an Affine Invariant Metric
International Journal of Computer Vision
Approximate congruence in nearly linear time
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Tracking People in a Railway Station During Rush-Hour
ICVS '99 Proceedings of the First International Conference on Computer Vision Systems
Content based retrieval of VRML objects: an iterative and interactive approach
Proceedings of the sixth Eurographics workshop on Multimedia 2001
On learning to predict web traffic
Decision Support Systems - Special issue: Web data mining
Coarse grained gather and scatter operations with applications
Journal of Parallel and Distributed Computing
Efficient Computation of the Hausdorff Distance Between Polytopes by Exterior Random Covering
Computational Optimization and Applications
Efficient Genetic Algorithm Based Data Mining Using Feature Selection with Hausdorff Distance
Information Technology and Management
Simple algorithms for partial point set pattern matching under rigid motion
Pattern Recognition
On visual similarity based 2D drawing retrieval
Computer-Aided Design
An improved algorithm for point set pattern matching under rigid motion
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
An incremental Hausdorff distance calculation algorithm
Proceedings of the VLDB Endowment
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Similarity search on a large collection of point sets
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Approximation algorithms for computing the earth mover's distance under transformations
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A polynomial time solution for protein chain pair simplification under the discrete fréchet distance
ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
Protein Chain Pair Simplification under the Discrete Fréchet Distance
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |