Result 1 to 20 of 33 total
Computing the discrete Fréchet distance with imprecise input. (English)
Int. J. Comput. Geom. Appl. 22, No. 1, 27-44 (2012).
1
Approximation algorithms for maximum independent set of pseudo-disks. (English)
Discrete Comput. Geom. 48, No. 2, 373-392 (2012).
2
Partial matching between surfaces using Fréchet distance. (English)
Fomin, Fedor V. (ed.) et al., Algorithm theory ‒ SWAT 2012. 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31154-3/pbk). Lecture Notes in Computer Science 7357, 13-23 (2012).
3
Approximating the Fréchet distance for realistic curves in near linear time. (English)
Discrete Comput. Geom. 48, No. 1, 94-127 (2012).
4
Detecting commuting patterns by clustering subtrajectories. (English)
Int. J. Comput. Geom. Appl. 21, No. 3, 253-282 (2011).
5
Computing the Fréchet distance between folded polygons. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 267-278 (2011).
6
Fréchet distance with speed limits. (English)
Comput. Geom. 44, No. 2, 110-120 (2011).
7
Transversal spring spaces, the equation $x=T(x,\dots,x)$ and applications. (English)
Math. Morav. 14, No. 2, 99-124 (2010).
8
Voronoi diagram of polygonal chains under the discrete Fréchet distance. (English)
Int. J. Comput. Geom. Appl. 20, No. 4, 471-484 (2010).
9
Fréchet distance problems in weighted regions. (English)
Discrete Math. Algorithms Appl. 2, No. 2, 161-179 (2010).
10
Mining trajectory corridors using Fréchet distance and meshing grids. (English)
Zaki, Mohammed J. (ed.) et al., Advances in knowledge discovery and data mining. 14th Pacific-Asia conference, PAKDD 2010, Hyderabad, India, June 21‒24, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-13656-6/pbk). Lecture Notes in Computer Science 6118. Lecture Notes in Artificial Intelligence, 228-237 (2010).
11
Can we compute the similarity between surfaces? (English)
Discrete Comput. Geom. 43, No. 1, 78-99 (2010).
12
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time. (English)
Comput. Geom. 43, No. 3, 295-311 (2010).
13
Shortest path problems on a polyhedral surface. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21‒23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 156-167 (2009).
14
Link distance and shortest path problems in the plane. (English)
Goldberg, Andrew V. (ed.) et al., Algorithmic aspects in information and management. 5th international conference, AAIM 2009, San Francisco, CA, USA, June 15‒17, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02157-2/pbk). Lecture Notes in Computer Science 5564, 140-151 (2009).
15
Algorithm of on-line handwriting signature verification based on discrete Fréchet distance. (English)
Kang, Lishan (ed.) et al., Advances in computation and intelligence. Third international symposium, ISICA 2008, Wuhan, China, December 19‒21, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-92136-3/pbk). Lecture Notes in Computer Science 5370, 461-469 (2008).
16
Computing the Fréchet distance between simple polygons. (English)
Comput. Geom. 41, No. 1-2, 2-20 (2008).
17
Normal-map between normal compatible manifolds. (English)
Int. J. Comput. Geom. Appl. 17, No. 5, 403-421 (2007).
18
Adaptive dissimilarity index for measuring time series proximity. (English)
Adv. Data Anal. Classif., ADAC 1, No. 1, 5-21 (2007).
19
Computing the Fréchet distance between piecewise smooth curves. (English)
Comput. Geom. 37, No. 3, 162-174 (2007).
20
Result 1 to 20 of 33 total
Start
Contact
Print
General Help
