Configurations of non-crossing rays and related problems

DOI10.1007/s00454-016-9765-7zbMath1335.05016OpenAlexW2291007963MaRDI QIDQ282735

Ferran Hurtado, Jorge Urrutia, Alfredo Daniel Garcia, F. Javier Tejel

Publication date: 12 May 2016

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/103873

zbMATH Keywords

cyclic permutationsenumerative problemsnon-crossing rays configurations

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Asymptotic enumeration (05A16) Discrete geometry (52C99)

Related Items (1)

Colored ray configurations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The clique problem in ray intersection graphs
• Counting triangulations of planar point sets
• On orthogonal ray graphs
• Non-crossing matchings of points with geometric objects
• Analytic combinatorics of non-crossing configurations
• Lower bounds on the number of crossing-free subgraphs of \(K_N\)
• A better upper bound on the number of triangulations of a planar point set
• A lower bound on the number of triangulations of planar point sets
• The order of points on the second convex hull of a simple polygon
• On the number of plane geometric graphs
• On the number of pseudo-triangulations of certain point sets
• Systems of linear equations of analytic type
• Counting Plane Graphs: Flippability and Its Applications
• Bounds on the Maximum Multiplicity of Some Common Geometric Graphs
• On the Recognition of Four-Directional Orthogonal Ray Graphs
• Research Problems in Discrete Geometry
• On the Number of Crossing‐Free Matchings, Cycles, and Partitions
• On the Number of Spanning Trees a Planar Graph Can Have
• Crossing-Free Subgraphs

This page was built for publication: Configurations of non-crossing rays and related problems