Enumerating order types for small sets with applications

DOI10.1145/378583.378596zbMath1374.68631OpenAlexW2095153043MaRDI QIDQ5361553

Hannes Krasser, Franz Aurenhammer, Oswin Aichholzer

Publication date: 29 September 2017

Published in: Proceedings of the seventeenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/378583.378596

zbMATH Keywords

triangulationoriented matroidgeometric graphdata basepoint configuration

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Oriented matroids in discrete geometry (52C40) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Related Items (3)

On planar path transformation ⋮ Towards compatible triangulations. ⋮ Disjointness graphs of segments in \(\mathbb{R}^2\) are almost all Hamiltonian

This page was built for publication: Enumerating order types for small sets with applications