Stabbing Segments with Rectilinear Objects

نویسندگان

  • Mercè Claverol
  • Delia Garijo
  • Matias Korman
  • Carlos Seara
  • Rodrigo I. Silveira
چکیده

Given a set S of n line segments in the plane, we say that a region R ⊆ R is a stabber for S ifR contains exactly one endpoint of each segment of S. In this paper we provide optimal or near-optimal algorithms for reporting all combinatorially different stabbers for several shapes of stabbers. Specifically, we consider the case in which the stabber can be described as the intersection of axis-parallel halfplanes (thus the stabbers are halfplanes, strips, quadrants, 3-sided rectangles, or rectangles). The running times are O(n) (for the halfplane case), O(n logn) (for strips, quadrants, and 3-sided rectangles), and O(n logn) (for rectangles).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Rectilinear Partitions with Minimum Stabbing Number

Let S be a set of n points in R, and let r be a parameter with 1 6 r 6 n. A rectilinear r-partition for S is a collection Ψ(S) := {(S1, b1), . . . , (St, bt)}, such that the sets Si form a partition of S, each bi is the bounding box of Si, and n/2r 6 |Si| 6 2n/r for all 1 6 i 6 t. The (rectilinear) stabbing number of Ψ(S) is the maximum number of bounding boxes in Ψ(S) that are intersected by a...

متن کامل

A 3-Approximation Algorithm for Computing Partitions with Minimum Stabbing number of Rectilinear Simple Polygons

Let P be a rectilinear simple polygon. The stabbing number of a partition of P into rectangles is the maximum number of rectangles stabbed by any axis-parallel segment inside P . We present a 3-approximation algorithm for finding a partition with minimum stabbing number. It is based on an algorithm that finds an optimal partition for histograms.

متن کامل

Counterexample for the 2-approximation of finding partitions of rectilinear polygons with minimum stabbing number

This paper presents a counterexample for the approximation algorithm proposed by Durocher and Mehrabi [1] for the general problem of finding a rectangular partition of a rectilinear polygon with minimum stabbing number.

متن کامل

Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number

The stabbing number of a partition of a rectilinear polygon P into rectangles is the maximum number of rectangles stabbed by any axis-parallel line segment contained in P . We consider the problem of finding a rectangular partition with minimum stabbing number for a given rectilinear polygon P . First, we impose a conforming constraint on partitions: every vertex of every rectangle in the parti...

متن کامل

Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem

We provide constant ratio approximation algorithms for two NP-hard problems, the rectangle stabbing problem and the rectilinear partitioning problem. In the rectangle stabbing problem, we are given a set of rectangles in two-dimensional space, with the objective of stabbing all rectangles with the minimum number of lines parallel to the x and y axes. We provide a 2-approximation algorithm, whil...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 309  شماره 

صفحات  -

تاریخ انتشار 2015