Piercing pairwise intersecting convex shapes in the plane

DOI10.1007/978-3-031-20624-5_41MaRDI QIDQ6164007

Ahmad Biniaz, Saman Bazargani, Prosenjit Bose

Publication date: 26 July 2023

Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Piercing families of convex sets with the \(d\)-intersection property in \(\mathbb R^{d}\)
• Efficient hidden surface removal for objects with small union size
• On the union of fat wedges and separating a collection of segments by a line
• 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
• On fat partitioning, fat covering and the union size of polygons
• Approximation of convex figures by pairs of rectangles
• Transversals for families of translates of a two-dimensional convex compact set
• Computing depth orders for fat objects and related problems
• Transversal numbers of translates of a convex body
• Range Searching and Point Location among Fat Objects
• Fat Triangles Determine Linearly Many Holes
• The Floodlight Problem
• Computing depth orders and related problems
• The union of congruent cubes in three dimensions
• Some Intersection Properties of Convex Bodies
• On point covers of \(c-\)oriented polygons
• Simple linear time algorithms for piercing pairwise intersecting disks

This page was built for publication: Piercing pairwise intersecting convex shapes in the plane