Configurations of non-crossing rays and related problems
From MaRDI portal
Publication:282735
DOI10.1007/S00454-016-9765-7zbMATH Open1335.05016OpenAlexW2291007963MaRDI QIDQ282735FDOQ282735
Authors: Ferran Hurtado, J. Urrutia, Alfredo García, 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
Recommendations
- Non-bicolourable finite configurations of rays and their deformations
- Intersecting convex sets by rays
- Intersecting convex sets by rays
- Long non-crossing configurations in the plane
- Long non-crossing configurations in the plane
- scientific article; zbMATH DE number 741010
- On some points-and-lines problems and configurations
- Crossing-free segments and triangles in point configurations
- Tverberg-type theorems for intersecting by rays
- Nonrational configurations, polytopes, and surfaces
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Asymptotic enumeration (05A16) Discrete geometry (52C99)
Cites Work
- Research Problems in Discrete Geometry
- Title not available (Why is that?)
- 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
- Bounds on the maximum multiplicity of some common geometric graphs
- On the recognition of four-directional orthogonal ray graphs
- On the Number of Crossing‐Free Matchings, Cycles, and Partitions
- On the number of spanning trees a planar graph can have
- The clique problem in ray intersection graphs
- Title not available (Why is that?)
- Crossing-Free Subgraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Counting triangulations of planar point sets
- Combinatorial methods with computer applications
- On orthogonal ray graphs
- Non-crossing matchings of points with geometric objects
Cited In (2)
This page was built for publication: Configurations of non-crossing rays and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q282735)
