On \(k\)-convex polygons

DOI10.1016/j.comgeo.2011.09.001zbMath1244.52005arXiv1007.3607OpenAlexW1585578196MaRDI QIDQ427049

Erik D. Demaine, Ferran Hurtado, Oswin Aichholzer, Jorge Urrutia, Franz Aurenhammer, Pedro A. Ramos

Publication date: 13 June 2012

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.3607

zbMATH Keywords

convexityvisibilitytransversal theory

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Convex sets in (2) dimensions (including convex curves) (52A10) General topics in the theory of algorithms (68W01)

Related Items (8)

Straight skeletons and mitered offsets of nonconvex polytopes ⋮ The Mathematics of Ferran Hurtado: A Brief Survey ⋮ Coverage with \(k\)-transmitters in the presence of obstacles ⋮ On \(k\)-convex point sets ⋮ Holes in 2-convex point sets ⋮ Geometric quadrangulations of a polygon ⋮ On Erdős-Szekeres-type problems for \(k\)-convex point sets ⋮ Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangulating and guarding realistic polygons
• The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2
• A three point convexity property
• On geodesic properties of polygons relevant to linear time triangulation
• General decomposition theorems for m-convex sets in the plane
• Ray shooting in polygons using geodesic triangulations
• Fundamentals of restricted-orientation convexity
• Visibility in semi-convex spaces
• On functional separately convex hulls
• Large empty convex polygons in \(k\)-convex sets
• Modem illumination of monotone polygons
• A sufficient condition for the existence of large empty convex polygons
• A note on convex decompositions of a set of points in the plane
• On a class of \(O(n^ 2)\) problems in computational geometry
• On \(k\)-convex point sets
• Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
• Coverage with k-Transmitters in the Presence of Obstacles
• Convex Partitions of Graphs
• Triangulation and shape-complexity
• Triangulating Simple Polygons and Equivalent Problems
• Self-adjusting binary search trees
• Design and Analysis of a Data Structure for Representing Sorted Lists
• An Optimal Algorithm for Finding the Kernel of a Polygon

This page was built for publication: On \(k\)-convex polygons