Code for "HEAT: Holistic Edge Attention Transformer for Structured Reconstruction", CVPR 2022
-
Updated
Mar 26, 2025 - Python
Code for "HEAT: Holistic Edge Attention Transformer for Structured Reconstruction", CVPR 2022
Fast and accurate tessellation of planar graphs with convex polygons
A simple and small .NET library for computational planar geometry.
Calculating the Risk of Valve Failures when Maintaining Water Supply Networks
Turn multidimensional data into unique, lightweight visual identities.
Understanding and implementation of the algorithm to get three-coloring in triangle-free planar graphs
Desarrollo de un algoritmo con la capacidad de dibujar grafos aleatorios y planos.
An implementation of layered H-partitions
Simulating cost of trauma in brain networks
Primeiro trabalho prático da disciplina de Algoritmos I
Planar edge-node graph from arbitrary polylines - detect interior line-line intersections and split. Pure Python, no PostGIS.
Graph drawing algorithm for constrained point sets with edge crossing minimization — Algorithms & Data Structures (UNIPG)
Python3 implementation of computational geometry algorithms
Java program demonstrating Mario, Zelda, and Pokemon to be NP-hard. Also includes algorithms for planarity testing, planar embedding, and graph drawing.
Add a description, image, and links to the planar-graph topic page so that developers can more easily learn about it.
To associate your repository with the planar-graph topic, visit your repo's landing page and select "manage topics."