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.
TopoLoom: topology-first graph drawing kernel for JS (planarity/embeddings/SPQR/dual routing/min-cost flow + coordinate pipelines)
Understanding and implementation of the algorithm to get three-coloring in triangle-free planar graphs
Python3 implementation of computational geometry algorithms
Graph drawing algorithm for constrained point sets with edge crossing minimization — Algorithms & Data Structures (UNIPG)
Simulating cost of trauma in brain networks
Planar edge-node graph from arbitrary polylines - detect interior line-line intersections and split. Pure Python, no PostGIS.
Three integers for any geometry file an agent writes: pieces, enclosed faces, Euler characteristic, from the arrangement rather than a render, shipped with the snap radius that decided them or a typed refusal.
Desarrollo de un algoritmo con la capacidad de dibujar grafos aleatorios y planos.
An implementation of layered H-partitions
Primeiro trabalho prático da disciplina de Algoritmos I
Deterministic, low-degree, approximately planar proximity graph from unstructured 2D points.
Java program demonstrating Mario, Zelda, and Pokemon to be NP-hard. Also includes algorithms for planarity testing, planar embedding, and graph drawing.
To associate your repository with the planar-graph topic, visit your repo's landing page and select "manage topics."