Computing the Fréchet distance between two polygonal curves
暂无分享,去创建一个
[1] D. M. Y. Sommerville,et al. An Introduction to The Geometry of N Dimensions , 2022 .
[2] G. C. Shephard,et al. Convex Polytopes , 1969, The Mathematical Gazette.
[3] Ihrer Grenzgebiete,et al. Ergebnisse der Mathematik und ihrer Grenzgebiete , 1975, Sums of Independent Random Variables.
[4] Daniel S. Hirschberg,et al. Algorithms for the Longest Common Subsequence Problem , 1977, JACM.
[5] Nimrod Megiddo,et al. Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[6] J. Böhm,et al. Polyedergeometrie in n-dimensionalen Räumen konstanter Krümmung , 1981 .
[7] Leonidas J. Guibas,et al. A kinetic framework for computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[8] Micha Sharir,et al. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles , 1986, Discret. Comput. Geom..
[9] Richard Cole,et al. Slowing down sorting networks to obtain faster sorting algorithms , 2015, JACM.
[10] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[11] Kurt Mehlhorn,et al. Congruence, similarity, and symmetries of geometric objects , 1987, SCG '87.
[12] Leonidas J. Guibas,et al. The upper envelope of piecewise linear functions: Algorithms and applications , 2015, Discret. Comput. Geom..
[13] Helmut Alt,et al. Approximate matching of polygonal shapes , 1995, SCG '91.
[14] Micha Sharir,et al. The upper envelope of voronoi surfaces and its applications , 1991, SCG '91.
[15] Jean-Claude Latombe,et al. Robot motion planning , 1970, The Kluwer international series in engineering and computer science.
[16] Günter Rote,et al. Computing the Minimum Hausdorff Distance Between Two Point Sets on a Line Under Translation , 1991, Inf. Process. Lett..
[17] Raimund Seidel,et al. Small-dimensional linear programming and convex hulls made easy , 1991, Discret. Comput. Geom..
[18] Klara Kedem,et al. Improvements on Geometric Pattern Matching Problems , 1992, SWAT.
[19] Sivan Toledo,et al. Applications of parametric searching in geometric optimization , 1992, SODA '92.
[20] Marie-Françoise Roy,et al. Real algebraic geometry , 1992 .
[21] Michael T. Goodrich,et al. Geometric Pattern Matching Under Euclidean Motion , 1993, Comput. Geom..
[22] Michael T. Goodrich,et al. Constructing arrangements optimally in parallel , 1993, Discret. Comput. Geom..
[23] Bernard Chazelle,et al. Point Location Among Hyperplanes and Unidirectional Ray-shooting , 1994, Comput. Geom..
[24] Michael Werman,et al. Affine point matching , 1994, Pattern Recognit. Lett..
[25] Günter Rote,et al. Matching shapes with a reference point , 1994, SCG '94.
[26] Nina Amenta,et al. Bounded boxes, Hausdorff distance, and a new proof of an interesting Helly-type theorem , 1994, SCG '94.
[27] Micha Sharir,et al. On translational motion planning in 3-space , 1994, SCG '94.
[28] Micha Sharir,et al. Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.
[29] Alon Efrat,et al. Geometric Pattern Matching in d-Dimensional Space , 1995, ESA.
[30] Marie-Françoise Roy,et al. On the combinatorial and algebraic complexity of Quanti erEliminationS , 1994 .
[31] S. Basu,et al. Algorithms in semi-algebraic geometry , 1996 .
[32] Micha Sharir,et al. The overlay of lower envelopes and its applications , 1996, Discret. Comput. Geom..
[33] William Rucklidge,et al. Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation , 1996, Discret. Comput. Geom..
[34] The Union of Convex Polyhedra in Three Dimensions , 1997, SIAM J. Comput..
[35] Dan Gusfield,et al. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .
[36] S. Basu,et al. COMPUTING ROADMAPS OF SEMI-ALGEBRAIC SETS ON A VARIETY , 1999 .
[37] Micha Sharir,et al. An Expander-Based Approach to Geometric Optimization , 1997, SIAM J. Comput..
[38] Micha Sharir,et al. On Translational Motion Planning of a Convex Polyhedron in 3-Space , 1997, SIAM J. Comput..
[39] S. Basu,et al. On Computing a Set of Points meeting every Semi-algebraically Connected Component of a Family of Pol , 1997 .
[40] G. Ziegler,et al. Basic properties of convex polytopes , 1997 .
[41] Günter Rote,et al. Matching Shapes with a Reference Point , 1997, Int. J. Comput. Geom. Appl..