From post

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Dynamic data structures for k-nearest neighbor queries., и . Comput. Geom., (апреля 2023)Improved Map Construction using Subtrajectory Clustering., , , , , , , , , и . LocalRec@SIGSPATIAL, стр. 5:1-5:4. ACM, (2020)An Experimental Evaluation of Grouping Definitions for Moving Entities., , , и . SIGSPATIAL/GIS, стр. 89-98. ACM, (2019)Computing the Expected Value and Variance of Geometric Measures., , и . ACM Journal of Experimental Algorithmics, (2018)Covering a Set of Line Segments with a Few Squares., , , , , и . CIAC, том 12701 из Lecture Notes in Computer Science, стр. 286-299. Springer, (2021)Segment Visibility Counting Queries in Polygons., , , , , , и . ISAAC, том 248 из LIPIcs, стр. 58:1-58:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Most Vital Segment Barriers., , , и . WADS, том 11646 из Lecture Notes in Computer Science, стр. 495-509. Springer, (2019)Dynamic Data Structures for k-Nearest Neighbor Queries., и . ISAAC, том 212 из LIPIcs, стр. 14:1-14:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Kinetic Geodesic Voronoi Diagrams in a Simple Polygon., , , и . SIAM J. Discret. Math., 37 (4): 2276-2311 (декабря 2023)The Complexity of Geodesic Spanners., , и . SoCG, том 258 из LIPIcs, стр. 16:1-16:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)