LIPIcs.SoCG.2022.68.pdf
- Filesize: 0.53 MB
- 4 pages
Document
Visualizing WSPDs and Their Applications (Media Exposition)
Authors
Anirban Ghosh 
,
FNU Shariful ,
David Wisnosky
-
Part of:
Volume:
38th International Symposium on Computational Geometry (SoCG 2022)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Computational Geometry (SoCG) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2022-06-01
File
Document Identifiers
Author Details
Cite AsGet BibTex
Anirban Ghosh, FNU Shariful, and David Wisnosky. Visualizing WSPDs and Their Applications (Media Exposition). In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 68:1-68:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.SoCG.2022.68
https://doi.org/10.4230/LIPIcs.SoCG.2022.68
Abstract
Introduced by Callahan and Kosaraju back in 1995, the concept of well-separated pair decomposition (WSPD) has occupied a special significance in computational geometry when it comes to solving distance problems in d-space. We present an in-browser tool that can be used to visualize WSPDs and several of their applications in 2-space. Apart from research, it can also be used by instructors for introducing WSPDs in a classroom setting. The tool will be permanently maintained by the third author at https://wisno33.github.io/VisualizingWSPDsAndTheirApplications/.
Subject Classification
ACM Subject Classification
- Theory of computation → Computational geometry
Keywords
- well-separated pair decomposition
- nearest neighbor
- geometric spanners
- minimum spanning tree
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
Fred Anderson, Anirban Ghosh, Matthew Graham, Lucas Mougeot, and David Wisnosky. An interactive tool for experimenting with bounded-degree plane geometric spanners (media exposition). In 37th International Symposium on Computational Geometry (SoCG 2021). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2021.
-
Paul B Callahan and S Rao Kosaraju. Faster algorithms for some geometric graph problems in higher dimensions. In SODA, volume 93, pages 291-300, 1993.
-
Paul B Callahan and S Rao Kosaraju. Algorithms for dynamic closest pair and n-body potential fields. In SODA, volume 95, pages 263-272, 1995.
-
Paul B Callahan and S Rao Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. Journal of the ACM (JACM), 42(1):67-90, 1995.
-
Sariel Har-Peled. Geometric approximation algorithms. Number 173 in Mathematical Surveys and Monographs. American Mathematical Soc., 2011.
-
Giri Narasimhan and Michiel Smid. Geometric spanner networks. Cambridge University Press, 2007.
-
Michiel Smid. The well-separated pair decomposition and its applications. In Handbook of Approximation Algorithms and Metaheuristics, pages 71-84. Chapman and Hall/CRC, 2018.