Shattering a set of objects in 2D
From MaRDI portal
Publication:1613422
DOI10.1016/S0166-218X(01)00315-8zbMath1052.68141MaRDI QIDQ1613422
Tomohiro Harayama, Tetsuo Asano, Subhas C. Nandy
Publication date: 29 August 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (5)
LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS ⋮ Complexity and approximation for discriminating and identifying code problems in geometric setups ⋮ On separating points by lines ⋮ Discriminating Codes in Geometric Setups ⋮ Topological sweep of the complete graph
Cites Work
- Unnamed Item
- Unnamed Item
- Separating and shattering long line segments
- The complexity and construction of many faces in arrangements of lines and of segments
- Topologically sweeping an arrangement
- On the union of fat wedges and separating a collection of segments by a line
- On a class of \(O(n^ 2)\) problems in computational geometry
- On finding the convex hull of a simple polygon
This page was built for publication: Shattering a set of objects in 2D