Skip to main content
Article thumbnail
Location of Repository

Stabbers of line segments in the plane ∗

By M. Claverol, D. Garijo, C. I. Grima, A. Márquez and C. Seara

Abstract

The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the following problems: computing the stabbing wedges for S, finding a stabbing wedge for a set of parallel segments with equal length, and computing other stabbers for S such as a double-wedge and a zigzag. The time and space complexities of the algorithms depend on the number of combinatorially different extreme lines, critical lines, and the number of different slopes that appear in S.

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.163.35
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www-ma2.upc.edu/seara/s... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.