Pages that link to "Item:Q1863073"
From MaRDI portal
The following pages link to Enumerating order types for small point sets with applications (Q1863073):
Displaying 46 items.
- Chromatic numbers of copoint graphs of convex geometries (Q397165) (← links)
- Erdős-Szekeres theorem for point sets with forbidden subconfigurations (Q452006) (← links)
- Convexity minimizes pseudo-triangulations (Q598549) (← links)
- On the number of simple arrangements of five double pseudolines (Q629847) (← links)
- Matroid enumeration for incidence geometry (Q664549) (← links)
- Thickness and colorability of geometric graphs (Q679741) (← links)
- On the crossing number of complete graphs (Q817025) (← links)
- Two disjoint 5-holes in point sets (Q827302) (← links)
- Abstract order type extension and new results on the rectilinear crossing number (Q870421) (← links)
- Realization of abstract convex geometries by point configurations (Q1041213) (← links)
- Drawing the Horton set in an integer grid of minimum size (Q1616238) (← links)
- Order on order types (Q1650795) (← links)
- A lower bound on the number of triangulations of planar point sets (Q1882855) (← links)
- Complete enumeration of small realizable oriented matroids (Q1943649) (← links)
- Algorithmic enumeration of surrounding polygons (Q1983143) (← links)
- On the number of order types in integer grids of small size (Q1984592) (← links)
- Many order types on integer grids of polynomial size (Q2096371) (← links)
- Connectivity of triangulation flip graphs in the plane (Q2105329) (← links)
- Optimal area polygonization problems: exact solutions through geometric duality (Q2147134) (← links)
- Perfect matchings with crossings (Q2169938) (← links)
- New lower bounds for Tverberg partitions with tolerance in the plane (Q2192113) (← links)
- A note on universal point sets for planar graphs (Q2206869) (← links)
- Faradžev Read-type enumeration of non-isomorphic CC systems (Q2230397) (← links)
- On \(k\)-convex point sets (Q2248736) (← links)
- A superlinear lower bound on the number of 5-holes (Q2306008) (← links)
- Approximating the rectilinear crossing number (Q2331210) (← links)
- The rectilinear local crossing number of \(K_{n}\) (Q2363361) (← links)
- On the number of plane geometric graphs (Q2373434) (← links)
- Gray code enumeration of plane straight-line graphs (Q2464050) (← links)
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles (Q2464053) (← links)
- Packing plane spanning trees and paths in complete geometric graphs (Q2628273) (← links)
- Tverberg-type theorems with altered intersection patterns (nerves) (Q2664116) (← links)
- Approximating the Rectilinear Crossing Number (Q2961535) (← links)
- On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs (Q2978191) (← links)
- Enumerating Neighborly Polytopes and Oriented Matroids (Q3194584) (← links)
- Crossing-Free Perfect Matchings in Wheel Point Sets (Q4604397) (← links)
- Topological Drawings Meet Classical Theorems from Convex Geometry (Q5014123) (← links)
- Area-Optimal Simple Polygonalizations: The CG Challenge 2019 (Q5102073) (← links)
- Subquadratic Encodings for Point Configurations (Q5115787) (← links)
- A Note on Universal Point Sets for Planar Graphs (Q5119378) (← links)
- Geometry and Generation of a New Graph Planarity Game (Q5233138) (← links)
- Clique-width of point configurations (Q5918571) (← links)
- Maximum rectilinear crossing number of uniform hypergraphs (Q6083186) (← links)
- Perfect matchings with crossings (Q6119827) (← links)
- (Q6124762) (← links)
- (Q6179339) (← links)