[HN Gopher] Mesh Edge Construction
       ___________________________________________________________________
        
       Mesh Edge Construction
        
       Author : atomlib
       Score  : 31 points
       Date   : 2025-06-02 15:23 UTC (7 hours ago)
        
 (HTM) web link (maxliani.wordpress.com)
 (TXT) w3m dump (maxliani.wordpress.com)
        
       | pca006132 wrote:
       | I am curious how the last algorithm is an order of magnitude
       | faster than the one based on sorting. There is no benchmark data,
       | and ideally there should be data for different mesh sizes, as
       | that affects the timing a lot (cache vs RAM).
       | 
       | I work on https://github.com/elalish/manifold which works with
       | triangular meshes, and one of the slowest operations we currently
       | have is halfedge pairing, I am interested in making it faster. We
       | are already using parallel merge sort for the stable sort,
       | switching to parallel radix sort which works well on random
       | distribution is not helping and I think we are currently
       | bandwidth bound. If building an edge list for each vertex can
       | improve cache locality and reduce bandwidth, that will be very
       | interesting.
        
       ___________________________________________________________________
       (page generated 2025-06-02 23:00 UTC)