On the public citation graph

Computing shortest transversals

https://doi.org/10.1007/bf02239165
0 signed · 54 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.1007/bf00181561openalex-snapshot
Two counterexamples concerning transversals for convex subsets of the plane
inferredcites →https://doi.org/10.1007/bf01898631openalex-snapshot
On common transversals
inferredcites →https://doi.org/10.1007/bf01934440openalex-snapshot
Stabbing line segments
inferredcites →https://doi.org/10.1007/bf01952419openalex-snapshot
Visibility between two edges of a simple polygon
inferredcites →https://doi.org/10.1007/bf02187911openalex-snapshot
Polyhedral line transversals in space
inferredcites →https://doi.org/10.1016/0020-0190(86)90045-1openalex-snapshot
Shortest paths in the plane with convex polygonal obstacles
inferredcites →https://doi.org/10.1016/0020-0190(87)90226-2openalex-snapshot
Efficient algorithms for common transversals
inferredcites →https://doi.org/10.1016/0020-0190(88)90120-2openalex-snapshot
The shortest watchtower and related problems for polyhedral terrains
inferredcites →https://doi.org/10.1016/0020-0190(89)90136-1openalex-snapshot
Finding the upper envelope of n line segments in O(n log n) time
inferredcites →https://doi.org/10.1016/0022-0000(81)90012-xopenalex-snapshot
Maintenance of configurations in the plane
inferredcites →https://doi.org/10.1016/0031-3203(85)90050-0openalex-snapshot
Finding the diameter of a set of lines
inferredcites →https://doi.org/10.1016/0166-218x(90)90127-xopenalex-snapshot
Algorithms for high dimensional stabbing problems
inferredcites →https://doi.org/10.1016/0196-6774(85)90005-7openalex-snapshot
Finding the smallest triangles containing a given convex polygon
inferredcites →https://doi.org/10.1016/0196-6774(85)90039-2openalex-snapshot
Computing the extreme distances between two convex polygons
inferredcites →https://doi.org/10.1016/0196-6774(86)90007-6openalex-snapshot
An optimal algorithm for finding minimal enclosing triangles
inferredcites →https://doi.org/10.1016/0196-6774(86)90010-6openalex-snapshot
Computing the convex hull of line intersections
inferredcites →https://doi.org/10.1016/0304-3975(82)90120-7openalex-snapshot
Fast detection of polyhedral intersection
inferredcites →https://doi.org/10.1016/0304-3975(85)90005-2openalex-snapshot
Finding transversals for sets of simple geometric figures
inferredcites →https://doi.org/10.1080/00029890.1970.11992438openalex-snapshot
Visible Shorelines
inferredcites →https://doi.org/10.1080/00029890.1976.11994073openalex-snapshot
The Sofa Problem
inferredcites →https://doi.org/10.1080/0025570x.1971.11976102openalex-snapshot
Geometric Extremum Problems
inferredcites →https://doi.org/10.1080/19300980.1959.12467611openalex-snapshot
On Two Famous Inequalities
inferredcites →https://doi.org/10.1090/dol/006openalex-snapshot
Maxima and Minima Without Calculus
inferredcites →https://doi.org/10.1090/s0002-9939-1953-0058996-7openalex-snapshot
Minimal Sets of Visibility
inferredcites →https://doi.org/10.1109/12.59852openalex-snapshot
An optimal algorithm for detecting weak visibility of a polygon
inferredcites →https://doi.org/10.1109/sfcs.1976.16openalex-snapshot
Geometric intersection problems
inferredcites →https://doi.org/10.1109/sfcs.1984.715942openalex-snapshot
A Polynomial Solution For Potato-Peeling And Other Polygon Inclusion And Enclosure Problems
inferredcites →https://doi.org/10.1109/sfcs.1988.21975openalex-snapshot
An optimal algorithm for intersecting line segments in the plane
inferredcites →https://doi.org/10.1109/tc.1981.1675729openalex-snapshot
An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge
inferredcites →https://doi.org/10.1137/0212052openalex-snapshot
Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
inferredcites →https://doi.org/10.1137/0213003openalex-snapshot
Linear Time Algorithms for Two- and Three-Variable Linear Programs
inferredcites →https://doi.org/10.1137/0215021openalex-snapshot
The Ultimate Planar Convex Hull Algorithm?
inferredcites →https://doi.org/10.1142/9789812791245openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1145/358746.358758openalex-snapshot
An on-line algorithm for fitting straight lines between data ranges
inferredcites →https://doi.org/10.1145/41958.41990openalex-snapshot
Algorithms for line transversals in space
inferredcites →https://doi.org/10.1145/73833.73861openalex-snapshot
Determining sector visibility of a polygon
inferredcites →https://doi.org/10.1145/800141.804662openalex-snapshot
Detection is easier than computation (Extended Abstract)
inferredcites →https://doi.org/10.1215/s0012-7094-49-01613-0openalex-snapshot
Some properties of L-sets in the plane
inferredcites →https://doi.org/10.2140/pjm.1976.64.333openalex-snapshot
External visibility
inferredcites →https://doi.org/10.2307/3026764openalex-snapshot
Maxima and Minima without Calculus
inferredcites →https://doi.org/10.5948/upo9780883859223openalex-snapshot
Geometric Inequalities

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_32openalex-snapshot
Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_7openalex-snapshot
Hyperplane Approximation and Related Topics
inferred← citeshttps://doi.org/10.1007/bf02246508openalex-snapshot
Optimal algorithms for some intersection radius problems
inferred← citeshttps://doi.org/10.1007/bfb0028280openalex-snapshot
A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50020-6openalex-snapshot
Visibility in the Plane
inferred← citeshttps://doi.org/10.1090/amsip/020/46openalex-snapshot
What is computational geometry
inferred← citeshttps://doi.org/10.1109/5.163405openalex-snapshot
Scanning the issue - Computational geometry (special issue intro.)
inferred← citeshttps://doi.org/10.1142/s0218195992000238openalex-snapshot
COMPUTING SHORTEST TRANSVERSALS OF SETS
inferred← citeshttps://doi.org/10.1142/s0218195999000054openalex-snapshot
COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME
inferred← citeshttps://doi.org/10.1142/s0218195999000078openalex-snapshot
COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON
inferred← citeshttps://doi.org/10.1145/109648.109656openalex-snapshot
Computing shortest transversals of sets (extended abstract)
inferred← citeshttps://doi.org/10.1145/109648.109657openalex-snapshot
Optimal algorithms for some smallest intersection radius problems (extended abstract)
inferred← citeshttps://doi.org/10.1145/299917.299918openalex-snapshot
Efficient algorithms for geometric optimization
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.