On the public citation graph
Lines in Space: Combinatorics and Algorithms
0 signed · 97 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-52921-7_93openalex-snapshot
Weaving patterns of lines and line segments in space
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf02122778openalex-snapshot
A deterministic view of random sampling and its use in geometry
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferredcites →https://doi.org/10.1007/bf02187785openalex-snapshot
The complexity of many cells in arrangements of planes and related problems
inferredcites →https://doi.org/10.1007/bf02187879openalex-snapshot
New applications of random sampling in computational geometry
inferredcites →https://doi.org/10.1007/bf02189317openalex-snapshot
On the zone of a surface in a hyperplane arrangement
inferredcites →https://doi.org/10.1007/bf02574706openalex-snapshot
Onk-sets in arrangements of curves and surfaces
inferredcites →https://doi.org/10.1007/bfb0028245openalex-snapshot
On the zone of a surface in a hyperplane arrangement
inferredcites →https://doi.org/10.1007/bfb0035760openalex-snapshot
A singly-exponential stratification scheme for real semi-algebraic varieties and its applications
inferredcites →https://doi.org/10.1016/0097-3165(94)90005-1openalex-snapshot
On joints in arrangements of lines in space and related problems
inferredcites →https://doi.org/10.1016/0304-3975(91)90261-yopenalex-snapshot
A singly exponential stratification scheme for real semi-algebraic varieties and its applications
inferredcites →https://doi.org/10.1017/cbo9780511623875openalex-snapshot
Methods of Algebraic Geometry
inferredcites →https://doi.org/10.1038/133967a0openalex-snapshot
Analytical Geometry of Three Dimensions
inferredcites →https://doi.org/10.1090/dimacs/006openalex-snapshot
Discrete and Computational Geometry: Papers from the DIMACS Special Year
inferredcites →https://doi.org/10.1090/dimacs/006/01openalex-snapshot
Geometric partitioning and its applications
inferredcites →https://doi.org/10.1090/s0002-9939-1964-0161339-9openalex-snapshot
On the Betti Numbers of Real Varieties
inferredcites →https://doi.org/10.1098/rstl.1865.0017openalex-snapshot
XVII. On a new geometry of space
inferredcites →https://doi.org/10.1109/ccv.1988.589969openalex-snapshot
Efficiently Computing And Representing Aspect Graphs Of Polyhedral Objects
inferredcites →https://doi.org/10.1109/fscs.1990.89543openalex-snapshot
Counting and cutting cycles of lines and rods in space
inferredcites →https://doi.org/10.1109/sfcs.1986.4openalex-snapshot
An algorithm for constructing the aspect graph
inferredcites →https://doi.org/10.1109/sfcs.1988.21973openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and surfaces
inferredcites →https://doi.org/10.1109/sfcs.1991.185345openalex-snapshot
An optimal convex hull algorithm and new results on cuttings
inferredcites →https://doi.org/10.1145/103418.103470openalex-snapshot
Approximations and optimal geometric divide-and-conquer
inferredcites →https://doi.org/10.1145/12130.12172openalex-snapshot
Constructing higher-dimensional convex hulls at logarithmic cost per face
inferredcites →https://doi.org/10.1145/22145.22165openalex-snapshot
A probabilistic algorithm for the post office problem
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/73393.73399openalex-snapshot
The complexity of many faces in arrangements of lines of segments
inferredcites →https://doi.org/10.1145/73393.73431openalex-snapshot
Arrangements of lines in 3-space: a data structure with applications
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
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-540-30140-0_3openalex-snapshot
Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_43openalex-snapshot
Ray Shooting and Stone Throwing
inferred← citeshttps://doi.org/10.1007/978-94-015-9064-8_41openalex-snapshot
Approximation in Line Space — Applications in Robot Kinematics and Surface Reconstruction
inferred← citeshttps://doi.org/10.1007/978-94-017-0657-5_28openalex-snapshot
Revisiting Plücker Coordinates in Vision-Based Control
inferred← citeshttps://doi.org/10.1007/pl00009479openalex-snapshot
Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions
inferred← citeshttps://doi.org/10.1007/s00454-004-1089-3openalex-snapshot
Dense Point Sets Have Sparse Delaunay Triangulations or ?... But Not Too Nasty?
inferred← citeshttps://doi.org/10.1007/s00454-004-1093-7openalex-snapshot
An Improved Bound for Joints in Arrangements of Lines in Space
inferred← citeshttps://doi.org/10.1007/s00454-004-1111-9openalex-snapshot
Incidences between Points and Circles in Three and Higher Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-004-1123-5openalex-snapshot
Cutting Triangular Cycles of Lines in Space
inferred← citeshttps://doi.org/10.1007/s00454-004-2864-xopenalex-snapshot
Computing the Writhing Number of a Polygonal Knot
inferred← citeshttps://doi.org/10.1007/s00454-005-1166-2openalex-snapshot
Lines Avoiding Unit Balls in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-012-9414-8openalex-snapshot
On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90025-5openalex-snapshot
The power of parallel projection
inferred← citeshttps://doi.org/10.1016/0097-3165(94)90005-1openalex-snapshot
On joints in arrangements of lines in space and related problems
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90009-hopenalex-snapshot
Counting and cutting cycles of lines and rods in space
inferred← citeshttps://doi.org/10.1016/0925-7721(94)90016-7openalex-snapshot
On stabbling lines for convex polyhedra in 3D
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50003-6openalex-snapshot
Arrangements and Their Applications**Work by PA. was supported by Army Research Office MURI grant DAAH04-96-1-0013, by a Sloan fellowship, by an NYI award, and by a grant from the U.S.–Israeli Binational Science Foundation. Work by M.S. was supported by NSF Grants CCR-91-22103 and CCR-93-11127, by…
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.10.001openalex-snapshot
Ray shooting and stone throwing with near-linear storage
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.10.006openalex-snapshot
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
inferred← citeshttps://doi.org/10.1016/j.comgeo.2021.101775openalex-snapshot
Bisecting three classes of lines
inferred← citeshttps://doi.org/10.1016/j.jcta.2004.12.008openalex-snapshot
Crossing patterns of semi-algebraic sets
inferred← citeshttps://doi.org/10.1016/s0010-4485(98)00076-1openalex-snapshot
An introduction to line geometry with applications
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00020-0openalex-snapshot
The union of moving polygonal pseudodiscs — Combinatorial bounds and applications
inferred← citeshttps://doi.org/10.1017/s0963548314000534openalex-snapshot
Improved Bounds for Incidences Between Points and Circles
inferred← citeshttps://doi.org/10.1089/cmb.2005.12.609openalex-snapshot
Protein Similarity from Knot Theory: Geometric Convolution and Line Weavings
inferred← citeshttps://doi.org/10.1090/conm/453/08808openalex-snapshot
Line problems in nonlinear computational geometry
inferred← citeshttps://doi.org/10.1109/cgi.1998.694246openalex-snapshot
Determining visibility between extended objects
inferred← citeshttps://doi.org/10.1109/fscs.1990.89543openalex-snapshot
Counting and cutting cycles of lines and rods in space
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366837openalex-snapshot
Almost tight upper bounds for lower envelopes in higher dimensions
inferred← citeshttps://doi.org/10.1111/j.1467-8659.2011.02089.xopenalex-snapshot
Lazy Visibility Evaluation for Exact Soft Shadows
inferred← citeshttps://doi.org/10.1137/080744694openalex-snapshot
Line Transversals of Convex Polyhedra in $\mathbb{R}^3$
inferred← citeshttps://doi.org/10.1137/1.9781611977073.10openalex-snapshot
Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees
inferred← citeshttps://doi.org/10.1137/120900708openalex-snapshot
Computing Correlation between Piecewise-Linear Functions
inferred← citeshttps://doi.org/10.1137/21m1408245openalex-snapshot
On Ray Shooting for Triangles in 3-Space and Related Problems
inferred← citeshttps://doi.org/10.1137/s009753970038050xopenalex-snapshot
An Enumerative Geometry Framework for Algorithmic Line Problems in $\mathbb R^3$
inferred← citeshttps://doi.org/10.1137/s0097539793244368openalex-snapshot
Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
inferred← citeshttps://doi.org/10.1137/s0097539793252080openalex-snapshot
Ray Shooting Amidst Spheres in Three Dimensions and Related Problems
inferred← citeshttps://doi.org/10.1142/s0218195907002367openalex-snapshot
REGION INTERVISIBILITY IN TERRAINS
inferred← citeshttps://doi.org/10.1145/1137856.1137872openalex-snapshot
Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
inferred← citeshttps://doi.org/10.1145/1497290.1497291openalex-snapshot
Testing bipartiteness of geometric intersection graphs
inferred← citeshttps://doi.org/10.1145/1810959.1810969openalex-snapshot
On the complexity of sets of free lines and line segments among balls in three dimensions
inferred← citeshttps://doi.org/10.1145/192161.192210openalex-snapshot
Fast computation of shadow boundaries using spatial coherence and backprojections
inferred← citeshttps://doi.org/10.1145/2462356.2462382openalex-snapshot
Improved bounds for incidences between points and circles
inferred← citeshttps://doi.org/10.1145/276884.276891openalex-snapshot
Raising roofs, crashing cycles, and playing pool
inferred← citeshttps://doi.org/10.1145/299917.299918openalex-snapshot
Efficient algorithms for geometric optimization
inferred← citeshttps://doi.org/10.1145/3591357openalex-snapshot
Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees
inferred← citeshttps://doi.org/10.1145/513400.513416openalex-snapshot
Incidences between points and circles in three and higher dimensions
inferred← citeshttps://doi.org/10.1145/780542.780622openalex-snapshot
Cutting triangular cycles of lines in space
inferred← citeshttps://doi.org/10.1145/997817.997826openalex-snapshot
On lines avoiding unit balls in three dimensions
inferred← citeshttps://doi.org/10.1177/027836402761412430openalex-snapshot
Visual Servoing from Lines
inferred← citeshttps://doi.org/10.2312/egwr/egwr02/191-202openalex-snapshot
Exact From-Region Visibility Culling
inferred← citeshttps://doi.org/10.46298/dmtcs.1367openalex-snapshot
Ramsey-type theorems for lines in 3-space
inferred← citeshttps://doi.org/10.48550/arxiv.0807.1221openalex-snapshot
Line Transversals of Convex Polyhedra in $\reals^3$
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0110030openalex-snapshot
Dense point sets have sparse Delaunay triangulations
inferred← citeshttps://doi.org/10.5555/313852.313901openalex-snapshot
Efficient generation of k-directional assembly sequences
inferred← citeshttps://doi.org/10.5555/545381.545397openalex-snapshot
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
inferred← citeshttps://doi.org/10.5555/982792.982921openalex-snapshot
Testing bipartiteness of geometric intersection graphs
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.