Enumerating order types for small point sets with applications

DOI10.1023/A:1021231927255zbMath1027.68127OpenAlexW16939786MaRDI QIDQ1863073

Hannes Krasser, Franz Aurenhammer, Oswin Aichholzer

Publication date: 11 March 2003

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021231927255

zbMATH Keywords

computational geometryorder typesplanar straight-line graphsrealizable matroids

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Oriented matroids in discrete geometry (52C40)

Related Items (47)

Drawing the Horton set in an integer grid of minimum size ⋮ The rectilinear local crossing number of \(K_{n}\) ⋮ Two disjoint 5-holes in point sets ⋮ A lower bound on the number of triangulations of planar point sets ⋮ Packing plane spanning trees and paths in complete geometric graphs ⋮ On the number of plane geometric graphs ⋮ Optimal area polygonization problems: exact solutions through geometric duality ⋮ Order on order types ⋮ Enumerating Neighborly Polytopes and Oriented Matroids ⋮ Abstract order type extension and new results on the rectilinear crossing number ⋮ Perfect matchings with crossings ⋮ Convexity minimizes pseudo-triangulations ⋮ Tverberg-type theorems with altered intersection patterns (nerves) ⋮ Chromatic numbers of copoint graphs of convex geometries ⋮ Area-Optimal Simple Polygonalizations: The CG Challenge 2019 ⋮ Maximum rectilinear crossing number of uniform hypergraphs ⋮ Flipping plane spanning paths ⋮ New lower bounds for Tverberg partitions with tolerance in the plane ⋮ Approximating the Rectilinear Crossing Number ⋮ Complete enumeration of small realizable oriented matroids ⋮ On the number of simple arrangements of five double pseudolines ⋮ Crossing-Free Perfect Matchings in Wheel Point Sets ⋮ A Note on Universal Point Sets for Planar Graphs ⋮ A note on universal point sets for planar graphs ⋮ On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs ⋮ Erdős-Szekeres theorem for point sets with forbidden subconfigurations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Matroid enumeration for incidence geometry ⋮ Faradžev Read-type enumeration of non-isomorphic CC systems ⋮ Gray code enumeration of plane straight-line graphs ⋮ Decompositions, partitions, and coverings with convex polygons and pseudo-triangles ⋮ Algorithmic enumeration of surrounding polygons ⋮ On the number of order types in integer grids of small size ⋮ Thickness and colorability of geometric graphs ⋮ On \(k\)-convex point sets ⋮ Perfect matchings with crossings ⋮ Clique-width of point configurations ⋮ A superlinear lower bound on the number of 5-holes ⋮ Geometry and Generation of a New Graph Planarity Game ⋮ Realization of abstract convex geometries by point configurations ⋮ Approximating the rectilinear crossing number ⋮ Subquadratic Encodings for Point Configurations ⋮ Many order types on integer grids of polynomial size ⋮ Topological Drawings Meet Classical Theorems from Convex Geometry ⋮ Connectivity of triangulation flip graphs in the plane ⋮ On the crossing number of complete graphs

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