A Note on the Number of General 4-holes in (Perturbed) Grids

DOI10.1007/978-3-319-48532-4_1zbMath1426.52009OpenAlexW2551712199MaRDI QIDQ2958082

Oswin Aichholzer, Birgit Vogtenhuber, Pavel Valtr, Thomas Hackl

Publication date: 1 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48532-4_1

zbMATH Keywords

Euler's totient functionnumber of general 4-holesvariation of the classical Erdős-Szekeres type problems

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Erd?s problems and related topics of discrete geometry (52C10) Arithmetic functions; related numbers; inversion formulas (11A25)

Related Items (1)

Twenty years of progress of \(\mathrm{JCDCG}^3\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(k\)-gons and \(k\)-holes in point sets
• Convex independent sets and 7-holes in restricted planar point sets
• Many empty triangles have a common edge
• 4-holes in point sets
• Sets with No Empty Convex 7-Gons
• Empty Simplices in Euclidean Space
• Empty non-convex and convex four-gons in random point sets
• Planar point sets with a small number of empty convex polygons

This page was built for publication: A Note on the Number of General 4-holes in (Perturbed) Grids