Sampson Wong
Sampson Wong
Bestätigte E-Mail-Adresse bei - Startseite
Zitiert von
Zitiert von
(k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warping
M Brankovic, K Buchin, K Klaren, A Nusser, A Popov, S Wong
Proceedings of the 28th International Conference on Advances in Geographic …, 2020
Translation invariant Fréchet distance queries
J Gudmundsson, A van Renssen, Z Saeidi, S Wong
Algorithmica 83, 3514-3533, 2021
An algorithm for the Euclidean cell decomposition of a cusped strictly convex projective surface
S Tillmann, S Wong
arXiv preprint arXiv:1512.01645, 2015
Computing the yolk in spatial voting games without computing median lines
J Gudmundsson, S Wong
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 2012-2019, 2019
Approximating the packedness of polygonal curves
J Gudmundsson, Y Sha, S Wong
Computational Geometry 108, 101920, 2023
Map matching queries on realistic input graphs under the Fréchet distance
J Gudmundsson, MP Seybold, S Wong
ACM Transactions on Algorithms 20 (2), 1-33, 2024
Cubic upper and lower bounds for subtrajectory clustering under the continuous Fréchet distance
J Gudmundsson, S Wong
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
Computing continuous dynamic time warping of time series in polynomial time
K Buchin, A Nusser, S Wong
arXiv preprint arXiv:2203.04531, 2022
Data Structures for Approximate Discrete Fr\'echet Distance
I van der Hoog, E Rotenberg, S Wong
arXiv preprint arXiv:2212.07124, 2022
The tight spanning ratio of the rectangle Delaunay triangulation
A van Renssen, Y Sha, Y Sun, S Wong
arXiv preprint arXiv:2211.11987, 2022
Oriented Spanners
K Buchin, J Gudmundsson, A Kalb, A Popov, C Rehs, A van Renssen, ...
arXiv preprint arXiv:2306.17097, 2023
Map matching queries under Fréchet distance on low-density spanners
K Buchin, M Buchin, J Gudmundsson, A Popov, S Wong
European Workshop on Computational Geometry, 2023
Improving the dilation of a metric graph by adding edges
J Gudmundsson, S Wong
ACM Transactions on Algorithms (TALG) 18 (3), 1-20, 2022
Covering a set of line segments with a few squares
J Gudmundsson, M van de Kerkhof, A van Renssen, F Staals, L Wiratma, ...
Theoretical Computer Science 923, 74-98, 2022
Approximating multiplicatively weighted voronoi diagrams: efficient construction with linear size
J Gudmundsson, MP Seybold, S Wong
arXiv preprint arXiv:2112.12350, 2021
Approximating the -low-density Value
J Gudmundsson, Z Huang, S Wong
International Computing and Combinatorics Conference, 71-82, 2023
Computing a Subtrajectory Cluster from c-packed Trajectories
J Gudmundsson, Z Huang, A van Renssen, S Wong
arXiv preprint arXiv:2307.10610, 2023
Approximate Discrete Fréchet distance: simplified, extended and structured.
I van der Hoog, E Rotenberg, S Wong
CoRR, 2022
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–18