SIAM Journal on Computing
Mountain climbing, ladder moving, and the ring-width of a polygon
American Mathematical Monthly
Introduction to algorithms
Approximation of convex polygons
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Approximate matching of polygonal shapes (extended abstract)
SCG '91 Proceedings of the seventh 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
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Multiresolution banded refinement to accelerate surface reconstruction from polygons
Proceedings of the fourteenth annual symposium on Computational geometry
Efficiently approximating polygonal paths in three and higher dimensions
Proceedings of the fourteenth annual symposium on Computational geometry
Classical floorplanning harmful?
ISPD '00 Proceedings of the 2000 international symposium on Physical design
Content based retrieval of VRML objects: an iterative and interactive approach
Proceedings of the sixth Eurographics workshop on Multimedia 2001
Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Algorithm of On-Line Handwriting Signature Verification Based on Discrete Fréchet Distance
ISICA '08 Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence
A Visual Perception Approach for Accurate Segmentation of Light Profiles
ICIAR '09 Proceedings of the 6th International Conference on Image Analysis and Recognition
Path simplification for metro map layout
GD'06 Proceedings of the 14th international conference on Graph drawing
Simplifying 3D polygonal chains under the discrete Fréchet distance
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Polyline approach for approximating Hausdorff distance between planar free-form curves
Computer-Aided Design
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
ISAAC'04 Proceedings of the 15th 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 |