Stabbing segments with rectilinear objects

DOI10.1016/j.amc.2017.04.001zbMath1411.68167arXiv1703.04329OpenAlexW2113994147MaRDI QIDQ1738129

Mercè Claverol, Rodrigo I. Silveira, Matias Korman, Carlos Seara, Delia Garijo

Publication date: 29 March 2019

Published in: Applied Mathematics and Computation, Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.04329

zbMATH Keywords

algorithmscomputational geometryline segmentsclassification problemsstabbing problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Stabbing segments with rectilinear objects, Stabbing circles for sets of segments in the plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex transversals
• New results on stabbing segments with a polygon
• Stabbers of line segments in the plane
• Voronoi diagram for services neighboring a highway
• Stabbing line segments
• Stabbing segments with rectilinear objects
• Polyhedral line transversals in space
• Lower bounds on stabbing lines in 3-space
• On intersecting a set of parallel line segments with a convex polygon of minimum area
• Transversals to line segments in three-dimensional space
• Lines through Segments in 3D Space
• COMPUTING SHORTEST TRANSVERSALS OF SETS
• ON INTERSECTING A SET OF ISOTHETIC LINE SEGMENTS WITH A CONVEX POLYGON OF MINIMUM AREA
• Path Simplification for Metro Map Layout
• SMALLEST COLOR-SPANNING OBJECT REVISITED
• Priority Search Trees
• An on-line algorithm for fitting straight lines between data ranges
• APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
• MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
• Line Transversals of Convex Polyhedra in $\mathbb{R}^3$