In this note, we report an error in our paper “Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number” [2]. Given an orthogonal polygon P and a partition of P into rectangles, the stabbing number of the partition is defined as the maximum number of rectangles stabbed by any orthogonal line segment inside P . Abam et al. [1] introduced the problem of finding a partition of P i...

BACKGROUND Idiopathic stabbing headache, which is a brief, sharp, severe jabbing pain that is confined to the head, responds well to treatment with indomethacin sodium. It may occur as a primary entity but more likely is associated with other types of headache, including migraine. SETTING Emergency department of a teaching hospital. PATIENT A 27-year-old man presented to the emergency depar...

This retrospective review of eight years of trauma registry data at an inner-city level-1 trauma center was undertaken to discover at what age urban children start to become at high risk of being victims of either a major gunshot wound or stabbing. We reviewed data from 2,191 patients who were the victim of either a gunshot wound or stabbing, were 18 years of age or under, and met pre-establish...

We study the Maximum Line-Pair Stabbing Problem: Given a planar point set S, find a pair of parallel lines within distance 6 from each others such that the number of points of S that intersect (stab) the area in between the two lines is maximized. There exists an algorithm that computes maximum stabbing in O(|S|2) time and space. We give a more space-efficient solution; the time complexity incr...

In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines that intersect all the rectangles. In this paper we study the capacitated version of this problem in which the input includes an integral capacity for each line. The capacity of a line bounds the number of rectangles ...

Let O = {O1, . . . , Om} be a set of m convex polygons in R 2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without reflection), is called free if B does not intersect the interior of any polygon in O at this placement. A placement z of B is called critical if B forms three “distinct” contacts with O at z. Let φ(B,O) be the number of f...