( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Maintaining the Extent of a Moving Point Set.

, , , и . Discret. Comput. Geom., 26 (3): 353-374 (2001)

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.

Pankaj Singh

Shireesh Pankaj

Pankaj Basu

Pankaj Goyal

Suman Agarwal

 

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

Massively parallel algorithms for computing TIN DEMs and contour trees for large terrains., , , и . SIGSPATIAL/GIS, стр. 25:1-25:10. ACM, (2016)Computing the Discrete Fréchet Distance in Subquadratic Time., , , и . SIAM J. Comput., 43 (2): 429-449 (2014)An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles., , и . CoRR, (2017)Union of Random Minkowski Sums and Network Vulnerability Analysis., , , и . CoRR, (2013)Computing the Discrete Fréchet Distance in Subquadratic Time, , , и . CoRR, (2012)An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications., , , и . CoRR, (2018)Computing Shortest Paths in the Plane with Removable Obstacles., , , и . SWAT, том 101 из LIPIcs, стр. 5:1-5:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Arrangements and Their Applications., и . Handbook of Computational Geometry, North Holland / Elsevier, (2000)Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons., , и . WABI, том 3692 из Lecture Notes in Computer Science, стр. 315-327. Springer, (2005)Modeling and Analyzing Massive Terrain Data Sets.. ISAAC, том 4835 из Lecture Notes in Computer Science, стр. 1. Springer, (2007)