A New Algorithm Makes It Faster to Find the Shortest Paths

A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the ...
IEEE

Multifeatures Graph-Cut Algorithm for Extraction of Buildings From Large-Scale Urban LiDAR Data

Abstract: Building extraction from airborne LiDAR data is significant for the accurate modeling of urban structures and constitutes a pivotal step in urban 3-D reconstruction. However, in complex ...
IEEE

Fast FPGA Accelerator of Graph Cut Algorithm With Threshold Global Relabel and Inertial Push

Abstract: Graph cut algorithms are popular in optimization tasks related to min-cut and max-flow problems. However, modern FPGA graph cut algorithm accelerators still need performance and memory ...
GitHub

Graph Editor: Single Input and Output Node

Currently each input and output in a nodegraph is their own separate node. This can complicate nodegraphs with many inputs or outputs. It would be interesting to instead have a single "input" node ...