Geometric Algorithms

[Back to full publication list]

  • 2025:
    [15] Pkd-tree: Parallel kd-tree with Batch Updates (To Appear)
    Ziyang Men, Zheqi Shen, Yan Gu, and Yihan Sun
    SIGMOD
     ACM Special Interest Group on Management of Data (SIGMOD), 2025   
    parallel kdtree for range search and kNN search
    Paper   
  • 2022:
    [14] Parallel Cover Trees and Applications
    Yan Gu, Zachary Napier, Yihan Sun, and Letong Wang
    SPAA
     ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2022   
    K-nearest neighbor, parallel cover tree
    Paper   Slides  
  • [13] POSTER: The Problem-Based Benchmark Suite (PBBS), V2
    Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Magdalen Dobson, and Yihan Sun
    PPoPP
     ACM Symposium on Principles and Practice of Parallel Programming (PPoPP), 2022   
    2D convex hull, 2D Delaunay triangulation, 2D Delaunay refinement, kNN (k nearest neighbors), 2D triangle-ray intersection, 2D rectangle counting query
    Paper   Code  
  • 2021:
    [12] ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain
    Shangdi Yu, Yiqiu Wang, Yan Gu, Laxman Dhulipala, and Julian Shun
    VLDB
     Proceedings of the VLDB Endowment (VLDB), 2021   
    hierarchical agglomerative clustering
    Paper   
  • [11] GeoGraph: A Framework for Graph Processing on Geometric Data
    Yiqiu Wang, Shangdi Yu, Laxman Dhulipala, Yan Gu, and Julian Shun
    SIGOPS-OSR
     ACM SIGOPS Operating Systems Review (SIGOPS-OSR), 2021   
    Enable parallel graph processing for geometric data
    Paper   Code  
  • [10] Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
    Yiqiu Wang, Shangdi Yu, Yan Gu, and Julian Shun
    SIGMOD
     ACM Special Interest Group on Management of Data (SIGMOD), 2021   
    Euclidean MST and spatial clustering
    Paper   Video  ArXiV  Code  
  • [9] An Experimental Study of a New Parallel Batch-Dynamic Closest Pair Data Structure
    Wang Yiqiu, Shangdi Yu, Yan Gu, and Julian Shun
    SoCG
     ACM Symposium on Computational Geometry (SoCG), 2021   
    Closest pair
    Paper   ArXiV  Code  
  • 2020:
    [8] Randomized Incremental Convex Hull is Highly Parallel
    Guy E. Blelloch, Yan Gu, Julian Shun, and Yihan Sun
    SPAA
     ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2020   
    Parallel convex hull
    Paper   Video  
  • [7] Parallelism in Randomized Incremental Algorithms
    Guy E. Blelloch, Yan Gu, Julian Shun, and Yihan Sun
    JACM
     Journal of the ACM (JACM), 2020   
    Parallel Delaunay triangulation, closest pair, smallest enclosing disk
    Paper   
  • [6] Theoretically-Efficient and Practical Parallel DBSCAN
    Yiqiu Wang, Yan Gu, and Julian Shun
    SIGMOD
     ACM Special Interest Group on Management of Data (SIGMOD), 2020   
    spatial clustering
    Paper   Video  ArXiV  Code  Page  
  • 2019:
    [5] Parallel Range, Segment and Rectangle Queries with Augmented Maps
    Yihan Sun, and Guy E. Blelloch
    ALENEX
     Algorithm Engineering and Experiments (ALENEX), 2019   
    Parallel range, segment and rectangle queries
    Paper   ArXiV  
  • 2018:
    [4] Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry
    Guy E. Blelloch, Yan Gu, Yihan Sun, and Julian Shun
    SPAA
     ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2018   
    Parallel write-efficient algorithms on Delaunay triangulation, k-d trees, interval tree, priority search tree, range tree
    Paper   ArXiV  
  • [3] PAM: Parallel Augmented Maps
    Yihan Sun, Daniel Ferizovic, and Guy E. Blelloch
    PPoPP
     ACM Symposium on Principles and Practice of Parallel Programming (PPoPP), 2018   
    Parallel range tree using P-trees
    Paper   ArXiV  Code  
  • 2016:
    [2] Parallelism in Randomized Incremental Algorithms
    Guy E. Blelloch, Yan Gu, Julian Shun, and Yihan Sun
    SPAA
     ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016   
    Parallel Delaunay triangulation, closet pair, smallest enclosing disk
    Paper   ArXiV  
  • 2013:
    [1] Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain
    Danny Z. Chen, Yan Gu, Jian Li, and Haitao Wang
    SWAT
     SWAT. Discrete & Computational Geometry (SWAT), 2013   
    Interval cover on 1D
    Paper