Document Open Access Logo

Proximity Alert: Ipelets for Neighborhood Graphs and Clustering (Media Exposition)

Authors Gitan Balogh, June Cagan, Bea Fatima, Auguste H. Gezalyan , Danesh Sivakumar , Arushi Srinivasan, Yixuan Sun, Vahe Zaprosyan, David M. Mount

PDF

File

Thumbnail PDF
PDF
LIPIcs.SoCG.2026.99.pdf
  • Filesize: 2.95 MB
  • 8 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
Keywords
  • neighborhood graphs
  • clustering
  • proximity graphs
  • Ipelets
  • visualization

Metrics

Abstract

Neighborhood graphs and clustering algorithms are fundamental structures in both computational geometry and data analysis. Visualizing them can help build insight into their behavior and properties. The Ipe extensible drawing editor, developed by Otfried Cheong, is a widely used software system for generating figures. One particular aspect of Ipe is the ability to add Ipelets, which extend its functionality. Here we showcase a set of Ipelets designed to help visualize neighborhood graphs and clustering algorithms. These include: ε-neighbor graphs, furthest-neighbor graphs, Gabriel graphs, k-nearest neighbor graphs, k-th-nearest neighbor graphs, k-mutual neighbor graphs, k-th-mutual neighbor graphs, asymmetric k-nearest neighbor graphs, asymmetric k-th-nearest neighbor graphs, relative-neighbor graphs, sphere-of-influence graphs, Urquhart graphs, Yao graphs, and clustering algorithms including complete-linkage, DBSCAN, HDBSCAN, k-means, k-means++, k-medoids, mean shift, and single-linkage. Our Ipelets are all programmed in Lua and are freely available.

Cite As Get BibTex

Gitan Balogh, June Cagan, Bea Fatima, Auguste H. Gezalyan, Danesh Sivakumar, Arushi Srinivasan, Yixuan Sun, Vahe Zaprosyan, and David M. Mount. Proximity Alert: Ipelets for Neighborhood Graphs and Clustering (Media Exposition). In 42nd International Symposium on Computational Geometry (SoCG 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 367, pp. 99:1-99:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.SoCG.2026.99

Author Details

Gitan Balogh
  • Department of Computer Science, University of Maryland, College Park, MD, USA
June Cagan
  • Department of Computer Science, University of Maryland, College Park, MD, USA
Bea Fatima
  • Department of Physics, Utrecht University, The Netherlands
Auguste H. Gezalyan
  • Université de Lorraine, CNRS, Inria, LORIA, F-54000 Nancy, France
Danesh Sivakumar
  • Department of Computer Science, University of Maryland, College Park, MD, USA
Arushi Srinivasan
  • Department of Computer Science, University of Maryland, College Park, MD, USA
Yixuan Sun
  • Department of Computer Science, University of Maryland, College Park, MD, USA
Vahe Zaprosyan
  • Department of Computer Science, University of Maryland, College Park, MD, USA
David M. Mount
  • Department of Computer Science, University of Maryland, College Park, MD, USA

Supplementary Materials

References

  1. Gitan Balogh, June Cagan, Bea Fatima, Auguste H. Gezalyan, Danesh Sivakumar, Arushi Srinivasan, Yixuan Sun, Vahe Zaprosyan, and David M. Mount. Proximity Alert: Ipelets for Neighborhood Graphs and Clustering. Software (visited on 2026-05-12). URL: https://github.com/Otcavo/Ipelets-Full-Library
    full metadata available at: https://doi.org/10.4230/artifacts.25979
  2. Gitan Balogh, June Cagan, Bea Fatima, Auguste H. Gezalyan, Danesh Sivakumar, Arushi Srinivasan, Yixuan Sun, Vahe Zaprosyan, and David M. Mount. Proximity Alert: Ipelets for Neighborhood Graphs and Clustering. Audiovisual (visited on 2026-05-12). URL: https://youtu.be/NQr-SY1x2qc
    full metadata available at: https://doi.org/10.4230/artifacts.25983
  3. Ricardo J. G. B. Campello, Davoud Moulavi, and Jörg Sander. Density-based clustering based on hierarchical density estimates. In Advances in Knowledge Discovery and Data Mining, pages 160-172. Springer, 2013. URL: https://doi.org/10.1007/978-3-642-37456-2_14.
  4. Otfried Cheong. The IPE extensible drawing editor. Version 7.2.28, 2024-03-12. URL: https://ipe.otfried.org/.
  5. Dorin Comaniciu and Peter Meer. Mean shift: A robust approach toward feature space analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(5):603-619, 2002. URL: https://doi.org/10.1109/34.1000236.
  6. Martin Ester, Hans-Peter Kriegel, Jörg Sander, and Xiaowei Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD), pages 226-231, 1996. URL: http://www.aaai.org/Library/KDD/1996/kdd96-037.php.
  7. Brian S. Everitt, Sabine Landau, Morven Leese, and Daniel Stahl. Cluster Analysis. Wiley, 5th edition, 2011. URL: https://doi.org/10.1002/9780470977811.
  8. Klint Faber, Auguste H. Gezalyan, Adam Martinson, Aniruddh Mutnuru, Nithin Parepally, Ryan Parker, Mihil Sreenilayam, Aram Zaprosyan, and David M. Mount. French onion soup, ipelets for points and polygons (media exposition). In 41st International Symposium on Computational Geometry (SoCG 2025), pages 83:1-83:6. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. URL: https://doi.org/10.4230/LIPIcs.SoCG.2025.83.
  9. Andreas Fabri and Sylvain Pion. CGAL: The computational geometry algorithms library. In Proceedings of the 17th ACM SIGSPATIAL international conference on advances in geographic information systems, pages 538-539, 2009. URL: https://doi.org/10.1145/1653771.1653865.
  10. K. Ruben Gabriel and Robert R. Sokal. A new statistical approach to geographic variation analysis. Systematic Zoology, 18(3):259-278, 1969. URL: https://doi.org/10.2307/2412323.
  11. David G. Kirkpatrick and John D. Radke. A framework for computational morphology. In G. T. Toussaint, editor, Computational Geometry, pages 217-248. North-Holland, 1985. URL: https://doi.org/10.1016/B978-0-444-87806-9.50013-X.
  12. Nithin Parepally, Ainesh Chatterjee, Auguste H. Gezalyan, Hongyang Du, Sukrit Mangla, Kenny Wu, Sarah Hwang, and David M. Mount. Ipelets for the convex polygonal geometry (media exposition). In 40th International Symposium on Computational Geometry (SoCG 2024), pages 92:1-92:7, 2024. URL: https://doi.org/10.4230/LIPIcs.SoCG.2024.92.
  13. Hae-Sang Park and Chi-Hyuck Jun. A simple and fast algorithm for K-medoids clustering. Expert Systems with Applications, 36(2):3336-3341, 2009. URL: https://doi.org/10.1016/j.eswa.2008.01.039.
  14. postechDNN. Ipelet. https://github.com/postechDNN/postechDNN/commits/ipelet/dnn/IPELET, 2022. (Commit hash: de82a8d).
  15. Godfried T. Toussaint. The relative neighbourhood graph of a finite planar set. Pattern Recognition, 12(4):261-268, 1980. URL: https://doi.org/10.1016/0031-3203(80)90066-7.
  16. Godfried T. Toussaint. A graph-theoretical primal sketch. Computational Morphology, pages 229-260, 1988. Google Scholar
  17. RB Urquhart. Algorithms for computation of relative neighbourhood graph. Electronics Letters, 16(14):556-557, 1980. Google Scholar
  18. Andrew Chi-Chih Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing, 11(4):721-736, 1982. URL: https://doi.org/10.1137/0211059.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact