On the public citation graph

Stabbing line segments

https://doi.org/10.1007/bf01934440

0 signed · 99 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0196-6774(81)90025-0openalex-snapshot

Dynamization of order decomposable set problems

inferredcites →https://doi.org/10.1109/sfcs.1976.16openalex-snapshot

Geometric intersection problems

inferredcites →https://doi.org/10.1109/sfcs.1980.47openalex-snapshot

The inherent complexity of dynamic data structures which accommodate range queries

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-48686-0_38openalex-snapshot

Maximum Stabbing Line in 2D Plane

inferred← citeshttps://doi.org/10.1007/3-540-51542-9_16openalex-snapshot

Weighted orthogonal linear L ∞-approximation and applications

inferred← citeshttps://doi.org/10.1007/3-540-51542-9_21openalex-snapshot

Stabbing parallel segments with a convex polygon

inferred← citeshttps://doi.org/10.1007/3-540-54233-7_171openalex-snapshot

Computing shortest transversals

inferred← citeshttps://doi.org/10.1007/3-540-55210-3_187openalex-snapshot

Linear approximation of simple objects

inferred← citeshttps://doi.org/10.1007/3-540-58218-5_10openalex-snapshot

Separating translates in the plane: Combinatorial bounds and an algorithm

inferred← citeshttps://doi.org/10.1007/978-3-319-22177-9_5openalex-snapshot

Stabbing Segments with Rectilinear Objects

inferred← citeshttps://doi.org/10.1007/978-3-540-46515-7_3openalex-snapshot

Effective Use of Geometric Properties for Clustering

inferred← citeshttps://doi.org/10.1007/978-3-540-74472-6_4openalex-snapshot

On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area

inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_21openalex-snapshot

On Higher Order Voronoi Diagrams of Line Segments

inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_22openalex-snapshot

On the Farthest Line-Segment Voronoi Diagram

inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_8openalex-snapshot

Geometric Transversal Theory

inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_7openalex-snapshot

Algorithms for High Dimensional Stabbing Problems

inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot

Davenport-Schinzel Sequences and their Geometric Applications

inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_22openalex-snapshot

Stabbing Circles for Sets of Segments in the Plane

inferred← citeshttps://doi.org/10.1007/bf01187036openalex-snapshot

Ray shooting on triangles in 3-space

inferred← citeshttps://doi.org/10.1007/bf01758856openalex-snapshot

Parallel methods for visibility and shortest-path problems in simple polygons

inferred← citeshttps://doi.org/10.1007/bf01941685openalex-snapshot

Sweep Methods for Parallel Computational Geometry

inferred← citeshttps://doi.org/10.1007/bf02187699openalex-snapshot

Diameter partitioning

inferred← citeshttps://doi.org/10.1007/bf02187733openalex-snapshot

The upper envelope of piecewise linear functions: Algorithms and applications

inferred← citeshttps://doi.org/10.1007/bf02187778openalex-snapshot

The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2

inferred← citeshttps://doi.org/10.1007/bf02187911openalex-snapshot

Polyhedral line transversals in space

inferred← citeshttps://doi.org/10.1007/bf02239165openalex-snapshot

Computing shortest transversals

inferred← citeshttps://doi.org/10.1007/bfb0028246openalex-snapshot

Ray-shooting and isotopy classes of lines in 3-dimensional space

inferred← citeshttps://doi.org/10.1007/s00373-021-02325-6openalex-snapshot

Maximum Spanning Trees in Normed Planes

inferred← citeshttps://doi.org/10.1007/s00453-014-9950-0openalex-snapshot

The Higher-Order Voronoi Diagram of Line Segments

inferred← citeshttps://doi.org/10.1007/s00453-017-0299-zopenalex-snapshot

Stabbing Circles for Sets of Segments in the Plane

inferred← citeshttps://doi.org/10.1007/s00453-025-01311-1openalex-snapshot

The Farthest Color Voronoi Diagram in the Plane

inferred← citeshttps://doi.org/10.1007/s00454-005-1183-1openalex-snapshot

Transversals to Line Segments in Three-Dimensional Space

inferred← citeshttps://doi.org/10.1016/0012-365x(86)90008-7openalex-snapshot

The complexity of cells in three-dimensional arrangements

inferred← citeshttps://doi.org/10.1016/0020-0190(86)90055-4openalex-snapshot

The one-dimensional weighted voronoi diagram

inferred← citeshttps://doi.org/10.1016/0020-0190(87)90226-2openalex-snapshot

Efficient algorithms for common transversals

inferred← citeshttps://doi.org/10.1016/0020-0190(89)90155-5openalex-snapshot

Lower bounds for line stabbing

inferred← citeshttps://doi.org/10.1016/0097-3165(86)90078-6openalex-snapshot

On the maximal number of edges of many faces in an arrangement

inferred← citeshttps://doi.org/10.1016/0166-218x(90)90127-xopenalex-snapshot

Algorithms for high dimensional stabbing problems

inferred← citeshttps://doi.org/10.1016/0166-218x(91)90065-5openalex-snapshot

Ordered stabbing of pairwise disjoint convex sets in linear time

inferred← citeshttps://doi.org/10.1016/0166-218x(93)90057-uopenalex-snapshot

Algorithms for weak and wide separation of sets

inferred← citeshttps://doi.org/10.1016/0166-218x(93)90113-3openalex-snapshot

Orthogonal weighted linear L1 and L∞ approximation and applications

inferred← citeshttps://doi.org/10.1016/0304-3975(85)90005-2openalex-snapshot

Finding transversals for sets of simple geometric figures

inferred← citeshttps://doi.org/10.1016/0734-189x(90)90135-iopenalex-snapshot

Stabbing parallel segments with a convex polygon

inferred← citeshttps://doi.org/10.1016/0885-064x(91)90004-hopenalex-snapshot

A role of lower semicontinuous functions in the combinatorial complexity of geometric problems

inferred← citeshttps://doi.org/10.1016/0925-7721(92)90015-kopenalex-snapshot

A convex hull algorithm for discs, and applications

inferred← citeshttps://doi.org/10.1016/0925-7721(94)90015-9openalex-snapshot

Linear approximation of simple objects

inferred← citeshttps://doi.org/10.1016/0925-7721(95)00043-7openalex-snapshot

Geometric orderings of intersecting translates and their applications

inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50012-6openalex-snapshot

Computational Geometry

inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50002-4openalex-snapshot

Davenport–Schinzel Sequences and Their Geometric Applications**Both authors have been supported by a grant from the U.S.–Israeli Binational Science Foundation. Pankaj Agarwal has also been supported by a National Science Foundation Grant CCR-93–01259, by an Army Research Office MURI grant…

inferred← citeshttps://doi.org/10.1016/j.amc.2017.04.001openalex-snapshot

Stabbing segments with rectilinear objects

inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.12.004openalex-snapshot

Stabbers of line segments in the plane

inferred← citeshttps://doi.org/10.1016/j.comgeo.2018.10.004openalex-snapshot

Geometric clustering in normed planes

inferred← citeshttps://doi.org/10.1016/j.endm.2018.06.033openalex-snapshot

Some clustering algorithms in normed planes

inferred← citeshttps://doi.org/10.1016/j.ipl.2006.07.008openalex-snapshot

Farthest line segment Voronoi diagrams

inferred← citeshttps://doi.org/10.1016/j.ipl.2007.08.029openalex-snapshot

On intersecting a set of parallel line segments with a convex polygon of minimum area

inferred← citeshttps://doi.org/10.1016/j.ipl.2023.106451openalex-snapshot

Discrete and mixed two-center problems for line segments

inferred← citeshttps://doi.org/10.1016/j.ipl.2026.106642openalex-snapshot

Bowties and hourglasses: Intersections of double-wedges or: Stabbing and avoiding line segments

inferred← citeshttps://doi.org/10.1016/j.jsc.2016.03.009openalex-snapshot

A persistence landscapes toolbox for topological statistics

inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00322-2openalex-snapshot

Efficient algorithm for transversal of disjoint convex polygons

inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00414-3openalex-snapshot

Transversal of disjoint convex polygons

inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00049-5openalex-snapshot

Linear approximation of simple objects

inferred← citeshttps://doi.org/10.1016/s0166-3615(98)00067-0openalex-snapshot

Optimal workpiece setups for 4-axis numerical control machining based on machinability

inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00131-1openalex-snapshot

Sets of lines and cutting out polyhedral objects

inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00006-6openalex-snapshot

Recognizing weakly convex visible polygons

inferred← citeshttps://doi.org/10.1109/globalsip.2013.6737071openalex-snapshot

Track estimation using link line crossing information in wireless networks

inferred← citeshttps://doi.org/10.1109/glocom.2014.7417431openalex-snapshot

Localization in Wireless Rechargeable Sensor Networks Using Mobile Directional Charger

inferred← citeshttps://doi.org/10.1109/glocom.2015.7417431openalex-snapshot

Localization in Wireless Rechargeable Sensor Networks Using Mobile Directional Charger

inferred← citeshttps://doi.org/10.1109/infocom.2014.6847961openalex-snapshot

TOC: Localizing wireless rechargeable sensors with time of charge

inferred← citeshttps://doi.org/10.1109/sfcs.1983.1openalex-snapshot

A kinetic framework for computational geometry

inferred← citeshttps://doi.org/10.1109/sfcs.1983.11openalex-snapshot

Constructing arrangements of lines and hyperplanes with applications

inferred← citeshttps://doi.org/10.1109/sfcs.1983.17openalex-snapshot

Filtering search: A new approach to query-answering

inferred← citeshttps://doi.org/10.1109/sfcs.1987.44openalex-snapshot

On the lower envelope of bivariate functions and its applications

inferred← citeshttps://doi.org/10.1109/tc.1984.1676388openalex-snapshot

Computational Geometry—A Survey

inferred← citeshttps://doi.org/10.1109/tc.2008.56openalex-snapshot

A Geometric Transversal Approach to Analyzing Track Coverage in Sensor Networks

inferred← citeshttps://doi.org/10.1137/0215024openalex-snapshot

Constructing Arrangements of Lines and Hyperplanes with Applications

inferred← citeshttps://doi.org/10.1137/0221051openalex-snapshot

Searching for a Mobile Intruder in a Polygonal Region

inferred← citeshttps://doi.org/10.1137/s0097539792229404openalex-snapshot

On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space

inferred← citeshttps://doi.org/10.1142/s021819590900312xopenalex-snapshot

ON INTERSECTING A SET OF ISOTHETIC LINE SEGMENTS WITH A CONVEX POLYGON OF MINIMUM AREA

inferred← citeshttps://doi.org/10.1142/s0218195913600121openalex-snapshot

ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM

inferred← citeshttps://doi.org/10.1142/s0218195992000238openalex-snapshot

COMPUTING SHORTEST TRANSVERSALS OF SETS

inferred← citeshttps://doi.org/10.1142/s0218654398000155openalex-snapshot

RECOGNIZING SHAPE IN ORDERED PLANAR NOISY DATA

inferred← citeshttps://doi.org/10.1145/109648.109656openalex-snapshot

Computing shortest transversals of sets (extended abstract)

inferred← citeshttps://doi.org/10.1145/160985.160994openalex-snapshot

An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems

inferred← citeshttps://doi.org/10.1145/2700257openalex-snapshot

TOC

inferred← citeshttps://doi.org/10.1145/41958.41990openalex-snapshot

Algorithms for line transversals in space

inferred← citeshttps://doi.org/10.1145/73393.73419openalex-snapshot

Clustering algorithms based on minimum and maximum spanning trees

inferred← citeshttps://doi.org/10.1145/73393.73430openalex-snapshot

Skewed projections with an application to line stabbing in R3

inferred← citeshttps://doi.org/10.1145/73833.73861openalex-snapshot

Determining sector visibility of a polygon

inferred← citeshttps://doi.org/10.1145/73833.73873openalex-snapshot

Stabbing pairwise disjoint translates in linear time

inferred← citeshttps://doi.org/10.1145/97444.97695openalex-snapshot

Generalized sweep methods for parallel computational geometry

inferred← citeshttps://doi.org/10.1145/98524.98539openalex-snapshot

Parallel methods for visibility and shortest path problems in simple polygons (preliminary version)

inferred← citeshttps://doi.org/10.1145/98524.98563openalex-snapshot

Stabbing and ray shooting in 3 dimensional space

inferred← citeshttps://doi.org/10.17169/refubium-8271openalex-snapshot

Stabbing and Covering Geometric Objects in the Plane

inferred← citeshttps://doi.org/10.22215/etd/2008-07701openalex-snapshot

Cutting a polygon with a line

inferred← citeshttps://doi.org/10.26754/uz.978-84-92774-11-1openalex-snapshot

XIII Encuentros de Geometría Computacional. Zaragoza, 29 de junio al 1 de julio de 2009

inferred← citeshttps://doi.org/10.48550/arxiv.1405.3806openalex-snapshot

The Higher-Order Voronoi Diagram of Line Segments

inferred← citeshttps://doi.org/10.48550/arxiv.1411.2816openalex-snapshot

An Expected Linear-Time Algorithm for the Farthest-Segment Voronoi Diagram

inferred← citeshttps://doi.org/10.48550/arxiv.1609.01662openalex-snapshot

Robust Computation of a Minimum Area Convex Polygon Stabber of a Set of Isothetic Line Segments

inferred← citeshttps://doi.org/10.48550/arxiv.math/0306401openalex-snapshot

The number of transversals to line segments in R^3

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.