A combinatorial property on angular orders of plane point sets

DOI10.1016/j.ipl.2011.03.009zbMath1260.68286OpenAlexW2096829185WikidataQ61732480 ScholiaQ61732480MaRDI QIDQ1944953

Dolores Lara, Ruy Fabila-Monroy, Clemens Huemer

Publication date: 28 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.03.009

zbMATH Keywords

combinatorial problemsstar-shaped polygonpoint setconvex angle

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Searching for empty convex polygons
• Improved upper bounds on the reflexivity of point sets
• Lower bounds on the number of crossing-free subgraphs of \(K_N\)
• Planar point sets with a small number of empty convex polygons

This page was built for publication: A combinatorial property on angular orders of plane point sets