Configurations of non-crossing rays and related problems

Redirect to:

• Configurations of non-crossing rays and related problems

DOI10.1007/S00454-016-9765-7MaRDI QIDQ282735zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3755865 (Why is no real title available?)
• scientific article; zbMATH DE number 1242264 (Why is no real title available?)
• scientific article; zbMATH DE number 729555 (Why is no real title available?)
• scientific article; zbMATH DE number 863491 (Why is no real title available?)
• 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
• Analytic combinatorics of non-crossing configurations
• Bounds on the maximum multiplicity of some common geometric graphs
• Combinatorial methods with computer applications
• Counting triangulations of planar point sets
• Crossing-Free Subgraphs
• Lower bounds on the number of crossing-free subgraphs of \(K_N\)
• Non-crossing matchings of points with geometric objects
• On orthogonal ray graphs
• On the Number of Crossing‐Free Matchings, Cycles, and Partitions
• On the number of plane geometric graphs
• On the number of pseudo-triangulations of certain point sets
• On the number of spanning trees a planar graph can have
• On the recognition of four-directional orthogonal ray graphs
• Research Problems in Discrete Geometry
• Systems of linear equations of analytic type
• The clique problem in ray intersection graphs
• The order of points on the second convex hull of a simple polygon

Cited in

(2)

• Extremal problems on ray sensor configurations
• Colored ray configurations

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)