On the public citation graph
Algorithms for bichromatic line-segment problems and polyhedral terrains
0 signed · 109 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-19487-8_7openalex-snapshot
Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques
inferredcites →https://doi.org/10.1007/978-3-642-83539-1_11openalex-snapshot
Reporting and Counting Intersections Between Two Sets of Line Segments
inferredcites →https://doi.org/10.1007/bf01840440openalex-snapshot
Fractional cascading: I. A data structuring technique
inferredcites →https://doi.org/10.1007/bf02187878openalex-snapshot
Computing convolutions by reciprocal search
inferredcites →https://doi.org/10.1007/bf02189314openalex-snapshot
Cutting hyperplanes for divide-and-conquer
inferredcites →https://doi.org/10.1007/bfb0028837openalex-snapshot
Intersecting two polyhedra one of which is convex
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/0022-0000(86)90025-5openalex-snapshot
Reporting and counting segment intersections
inferredcites →https://doi.org/10.1016/0196-6774(82)90016-5openalex-snapshot
Rectilinear line segment intersection, layered segment trees, and dynamization
inferredcites →https://doi.org/10.1016/s0747-7171(08)80065-xopenalex-snapshot
An algorithm for generalized point location and its applications
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.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1137/0218055openalex-snapshot
An Optimal-Time Algorithm for Slope Selection
inferredcites →https://doi.org/10.1145/103418.103470openalex-snapshot
Approximations and optimal geometric divide-and-conquer
inferredcites →https://doi.org/10.1145/147508.147511openalex-snapshot
An optimal algorithm for intersecting line segments in the plane
inferredcites →https://doi.org/10.1145/77635.77639openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11841036_37openalex-snapshot
Region-Restricted Clustering for Geographic Data Mining
inferred← citeshttps://doi.org/10.1007/11944836_11openalex-snapshot
Computing a Center-Transversal Line
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_12openalex-snapshot
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_29openalex-snapshot
Computing the Penetration Depth of Two Convex Polytopes in 3D
inferred← citeshttps://doi.org/10.1007/3-540-47738-1_23openalex-snapshot
Intersecting Red and Blue Line Segments in Optimal Time and Precision
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_32openalex-snapshot
Optimal Facility Location under Various Distance Functions
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_255openalex-snapshot
Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_277openalex-snapshot
Counting and reporting red/blue segment intersections
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_151openalex-snapshot
External-memory algorithms for processing line segments in geographic information systems
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_64openalex-snapshot
Reporting red-blue intersections between two sets of connected line segments
inferred← citeshttps://doi.org/10.1007/3-540-63818-0_8openalex-snapshot
External-memory algorithms with applications in GIS
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_19openalex-snapshot
Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_20openalex-snapshot
Finding Pairwise Intersections Inside a Query Range
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_40openalex-snapshot
Searching Edges in the Overlap of Two Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-75172-6_6openalex-snapshot
Minimum-Width Square Annulus Intersecting Polygons
inferred← citeshttps://doi.org/10.1007/978-3-540-30561-3_28openalex-snapshot
Overlaying Multiple Maps Efficiently
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_27openalex-snapshot
Placing Text Boxes on Graphs
inferred← citeshttps://doi.org/10.1007/bf02187809openalex-snapshot
Partitioning arrangements of lines II: Applications
inferred← citeshttps://doi.org/10.1007/bf02523679openalex-snapshot
On counting pairs of intersecting segments and off-line triangle range searching
inferred← citeshttps://doi.org/10.1007/bf02573973openalex-snapshot
Diameter, width, closest line pair, and parametric searching
inferred← citeshttps://doi.org/10.1007/bf02574376openalex-snapshot
On lines missing polyhedral sets in 3-space
inferred← citeshttps://doi.org/10.1007/bf02574385openalex-snapshot
Can visibility graphs Be represented compactly?
inferred← citeshttps://doi.org/10.1007/bfb0015247openalex-snapshot
Algorithmic techniques for geometric optimization
inferred← citeshttps://doi.org/10.1007/bfb0054379openalex-snapshot
On the number of regular vertices of the union of Jordan regions
inferred← citeshttps://doi.org/10.1007/pl00008263openalex-snapshot
A Randomized Algorithm for the Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors
inferred← citeshttps://doi.org/10.1007/pl00009494openalex-snapshot
On the Complexity of the Union of Fat Convex Objects in the Plane
inferred← citeshttps://doi.org/10.1007/s00453-002-0967-4openalex-snapshot
Reporting Red--Blue Intersections between Two Sets of Connected Line Segments
inferred← citeshttps://doi.org/10.1007/s00453-005-1191-9openalex-snapshot
Approximate unions of lines and minkowski sums
inferred← citeshttps://doi.org/10.1007/s00453-006-1208-zopenalex-snapshot
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems
inferred← citeshttps://doi.org/10.1007/s00453-017-0384-3openalex-snapshot
Finding Pairwise Intersections Inside a Query Range
inferred← citeshttps://doi.org/10.1007/s00453-026-01395-3openalex-snapshot
Segment Proximity Graphs and Nearest Neighbor Queries amid Disjoint Segments
inferred← citeshttps://doi.org/10.1007/s00454-001-0001-7openalex-snapshot
On the number of regular vertices of the union of jordan regions
inferred← citeshttps://doi.org/10.1007/s00454-006-1263-xopenalex-snapshot
On the Union of κ-Round Objects in Three and Four Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-006-1272-9openalex-snapshot
A Single Cell in an Arrangement of Convex Polyhedra in ${\Bbb R}^3$
inferred← citeshttps://doi.org/10.1007/s00454-015-9677-yopenalex-snapshot
On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1007/s00454-022-00433-5openalex-snapshot
Bipartite Diameter and Other Measures Under Translation
inferred← citeshttps://doi.org/10.1007/s10852-010-9144-yopenalex-snapshot
Data Structures for Extension Violations in a Query Range
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(95)00005-8openalex-snapshot
Computing depth orders for fat objects and related problems
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50008-5openalex-snapshot
Applications of Computational Geometry to Geographic Information Systems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.08.004openalex-snapshot
Local polyhedra and geometric graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.08.003openalex-snapshot
Region-restricted clustering for geographic data mining
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101945openalex-snapshot
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102171openalex-snapshot
Finding a largest-area triangle in a terrain in near-linear time
inferred← citeshttps://doi.org/10.1016/j.mex.2019.02.028openalex-snapshot
A simple and space efficient segment tree implementation
inferred← citeshttps://doi.org/10.1016/j.neuroimage.2012.03.026openalex-snapshot
Measuring and comparing brain cortical surface area and other areal quantities
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.034openalex-snapshot
Multidimensional segment trees can do range updates in poly-logarithmic time
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115583openalex-snapshot
On k -enclosing slab problems
inferred← citeshttps://doi.org/10.1016/s0010-4485(02)00099-4openalex-snapshot
Reducing feasible contacts between polyhedral models to red–blue intersections on the sphere
inferred← citeshttps://doi.org/10.1016/s0925-7721(00)00012-2openalex-snapshot
Reporting curve segment intersections using restricted predicates
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00049-4openalex-snapshot
Reporting intersecting pairs of convex polytopes in two and three dimensions
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.1109/fscs.1990.89543openalex-snapshot
Counting and cutting cycles of lines and rods in space
inferred← citeshttps://doi.org/10.1109/icpp.2006.5openalex-snapshot
A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams
inferred← citeshttps://doi.org/10.1109/ssdm.2000.869791openalex-snapshot
Toward spatial joins for polygons
inferred← citeshttps://doi.org/10.1137/0219020openalex-snapshot
Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection
inferred← citeshttps://doi.org/10.1137/1.9781611973099.27openalex-snapshot
Computing the Distance between Piecewise-Linear Bivariate Functions
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/s0097539702407515openalex-snapshot
The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
inferred← citeshttps://doi.org/10.1137/s0097539794265724openalex-snapshot
Computing Envelopes in Four Dimensions with Applications
inferred← citeshttps://doi.org/10.1137/s0097539797329373openalex-snapshot
Robust Plane Sweep for Intersecting Segments
inferred← citeshttps://doi.org/10.1137/s0097539798337212openalex-snapshot
Space-Time Tradeoffs for Emptiness Queries
inferred← citeshttps://doi.org/10.1142/s0218195900000292openalex-snapshot
OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
inferred← citeshttps://doi.org/10.1145/1064092.1064099openalex-snapshot
Almost tight bound for a single cell in an arrangement of convex polyhedra in R 3
inferred← citeshttps://doi.org/10.1145/1250790.1250796openalex-snapshot
Voronoi diagrams in n · 2 o(√lg lg n) time
inferred← citeshttps://doi.org/10.1145/160985.160990openalex-snapshot
On lines missing polyhedral sets in 3-space
inferred← citeshttps://doi.org/10.1145/160985.161160openalex-snapshot
Can visibility graphs be represented compactly?
inferred← citeshttps://doi.org/10.1145/177424.178081openalex-snapshot
Computing envelopes in four dimensions with applications
inferred← citeshttps://doi.org/10.1145/1810959.1811020openalex-snapshot
Computing similarity between piecewise-linear functions
inferred← citeshttps://doi.org/10.1145/1868237.1868247openalex-snapshot
Geodesic Fréchet distance inside a simple polygon
inferred← citeshttps://doi.org/10.1145/2582112.2582166openalex-snapshot
On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1145/262839.262988openalex-snapshot
Space-time tradeoffs for emptiness queries (extended abstract)
inferred← citeshttps://doi.org/10.1145/276884.276908openalex-snapshot
On the union of κ-curved objects
inferred← citeshttps://doi.org/10.1145/2847257openalex-snapshot
Computing the Distance between Piecewise-Linear Bivariate Functions
inferred← citeshttps://doi.org/10.1145/299917.299918openalex-snapshot
Efficient algorithms for geometric optimization
inferred← citeshttps://doi.org/10.1145/304893.304958openalex-snapshot
The complexity of the union of (α, β)-covered objects
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/73007.73044openalex-snapshot
Lines in space-combinators, algorithms and applications
inferred← citeshttps://doi.org/10.1145/777792.777820openalex-snapshot
Local polyhedra and geometric graphs
inferred← citeshttps://doi.org/10.1145/997817.997875openalex-snapshot
On the union of κ-round objects
inferred← citeshttps://doi.org/10.22215/etd/2006-08509openalex-snapshot
Parallel Voronoi diagrams for VLSI design
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2019.47openalex-snapshot
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems
inferred← citeshttps://doi.org/10.4230/lipics.socg.2020.33openalex-snapshot
Finding Closed Quasigeodesics on Convex Polyhedra
inferred← citeshttps://doi.org/10.48550/arxiv.1701.02229openalex-snapshot
Searching edges in the overlap of two plane graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1703.01544openalex-snapshot
L-Graphs and Monotone L-Graphs
inferred← citeshttps://doi.org/10.5555/642992.642999openalex-snapshot
Penetration depth of two convex polytopes in 3D
inferred← citeshttps://doi.org/10.7146/brics.v3i12.19975openalex-snapshot
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems
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.