On the public citation graph
Scanline algorithms on a grid
0 signed · 58 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/bf01786986openalex-snapshot
A priority queue in which initialization and queue operations takeO(loglogD) time
inferredcites →https://doi.org/10.1016/0020-0190(73)90020-3openalex-snapshot
On the identification of the convex hull of a finite set of points in the plane
inferredcites →https://doi.org/10.1016/0020-0190(77)90031-xopenalex-snapshot
Preserving order in a forest in less than logarithmic time and linear space
inferredcites →https://doi.org/10.1016/0020-0190(83)90075-3openalex-snapshot
Log-logarithmic worst-case range queries are possible in space Θ(N)
inferredcites →https://doi.org/10.1016/0020-0190(88)90188-3openalex-snapshot
Normalized divide-and-conquer: A scaling technique for solving multi-dimensional problems
inferredcites →https://doi.org/10.1016/0022-0000(84)90020-5openalex-snapshot
New trie data structures which support very fast search operations
inferredcites →https://doi.org/10.1016/0304-3975(83)90023-3openalex-snapshot
Upper bounds for sorting integers on random access machines
inferredcites →https://doi.org/10.1051/ita/1984180201711openalex-snapshot
Computing the connected components of simple rectilinear geometrical objects in $d$-space
inferredcites →https://doi.org/10.1080/00207168308803364openalex-snapshot
A new approach to rectangle intersections part I
inferredcites →https://doi.org/10.1080/00207168308803365openalex-snapshot
A new approach to rectangle intersections
inferredcites →https://doi.org/10.1109/sfcs.1979.22openalex-snapshot
Locking policies: Safety and freedom from deadlock
inferredcites →https://doi.org/10.1109/tc.1979.1675432openalex-snapshot
Algorithms for Reporting and Counting Geometric Intersections
inferredcites →https://doi.org/10.1137/0214046openalex-snapshot
An $O(E\log E + I)$ Expected Time Algorithm for the Planar Segment Intersection Problem
inferredcites →https://doi.org/10.1145/321906.321910openalex-snapshot
On Finding the Maxima of a Set of Vectors
inferredcites →https://doi.org/10.1145/588111.588130openalex-snapshot
An optimal algorithm for testing for safety and detecting deadlocks in locked transaction systems
inferredcites →https://doi.org/10.1145/800057.808674openalex-snapshot
Intersecting is easier than sorting
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ima.20266openalex-snapshot
On finding an orthogonal convex skull of a digital object
inferred← citeshttps://doi.org/10.1007/3-540-44472-6_9openalex-snapshot
2-D Spatial Indexing Scheme in Optimal Time
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_31openalex-snapshot
Geometric Searching over the Rationals
inferred← citeshttps://doi.org/10.1007/3-540-60159-7_14openalex-snapshot
Implementation of the ROSE algebra: Efficient algorithms for realm-based spatial data types
inferred← citeshttps://doi.org/10.1007/978-3-540-74472-6_1openalex-snapshot
Some Problems Related to Good Illumination
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_68openalex-snapshot
Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations
inferred← citeshttps://doi.org/10.1007/978-3-642-61340-1_4openalex-snapshot
Computational Geometry and its Application to Computer Graphics
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_5openalex-snapshot
Computational geometry on a grid an overview
inferred← citeshttps://doi.org/10.1007/bf01990525openalex-snapshot
Parallel algorithms for permutation graphs
inferred← citeshttps://doi.org/10.1007/bf01994845openalex-snapshot
The weighted maximum independent set problem in permutation graphs
inferred← citeshttps://doi.org/10.1007/bfb0015936openalex-snapshot
The convex hull problem on grids computational and combinatorial aspects
inferred← citeshttps://doi.org/10.1007/s002360050126openalex-snapshot
Partitioning a sequence into few monotone subsequences
inferred← citeshttps://doi.org/10.1007/s11075-025-02229-zopenalex-snapshot
Efficient real-time and parallel algorithm for connected orthogonal convex hulls on large point sets
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90188-3openalex-snapshot
Normalized divide-and-conquer: A scaling technique for solving multi-dimensional problems
inferred← citeshttps://doi.org/10.1016/0196-6774(88)90041-7openalex-snapshot
Efficient data structures for range searching on a grid
inferred← citeshttps://doi.org/10.1016/j.amc.2020.125889openalex-snapshot
A modified Graham’s convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
inferred← citeshttps://doi.org/10.1016/j.amc.2022.127183openalex-snapshot
A fast and efficient algorithm for determining the connected orthogonal convex hulls
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.02.006openalex-snapshot
Computing minimum-area rectilinear convex hull and L-shape
inferred← citeshttps://doi.org/10.1016/j.ins.2012.05.029openalex-snapshot
A linear-time combinatorial algorithm to find the orthogonal hull of an object on the digital plane
inferred← citeshttps://doi.org/10.1016/j.ipl.2022.106245openalex-snapshot
Geometric separability using orthogonal objects
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00090-2openalex-snapshot
On building the transitive reduction of a two-dimensional poset
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00145-3openalex-snapshot
A new algorithm for rectangle enclosure reporting
inferred← citeshttps://doi.org/10.1080/00207169008803871openalex-snapshot
Ranking intervals under visibility constraints∗
inferred← citeshttps://doi.org/10.1089/10665270050081531openalex-snapshot
Winnowing Sequences from a Database Search
inferred← citeshttps://doi.org/10.1109/cidm.2014.7008683openalex-snapshot
Interpolation and extrapolation: Comparison of definitions and survey of algorithms for convex and concave hulls
inferred← citeshttps://doi.org/10.1109/focs.2009.53openalex-snapshot
Delaunay Triangulations in O(sort(n)) Time and More
inferred← citeshttps://doi.org/10.1109/itsc.2017.8317765openalex-snapshot
Negotiation of drivable areas of cooperative vehicles for conflict resolution
inferred← citeshttps://doi.org/10.1109/tcad.2015.2432132openalex-snapshot
DÉJÀ VU: An Entropy Reduced Hash Function for VLSI Layout Databases
inferred← citeshttps://doi.org/10.1109/tevc.2017.2655451openalex-snapshot
Multiline Distance Minimization: A Visualized Many-Objective Test Problem Suite
inferred← citeshttps://doi.org/10.1137/07068669xopenalex-snapshot
Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
inferred← citeshttps://doi.org/10.1145/1944345.1944347openalex-snapshot
Delaunay triangulations in O (sort( n )) time and more
inferred← citeshttps://doi.org/10.1145/299432.299451openalex-snapshot
Winnowing sequences from a database search
inferred← citeshttps://doi.org/10.1145/3369740.3372916openalex-snapshot
Convex Hull Formation for Programmable Matter
inferred← citeshttps://doi.org/10.20382/jocg.v2i1a8openalex-snapshot
Optimally fast incremental Manhattan plane embedding and planar tight span construction
inferred← citeshttps://doi.org/10.20382/v2i1a8openalex-snapshot
Optimally fast incremental Manhattan plane embedding and planar tight span construction
inferred← citeshttps://doi.org/10.2312/eggh/eggh87/003-019openalex-snapshot
New Algorithms for Computer Graphics
inferred← citeshttps://doi.org/10.24867/meta.2024.01openalex-snapshot
ON THE COMPUTATION OF THE ORTHOGONAL HULL OF SIMPLE RECTILINEAR POLYGONS
inferred← citeshttps://doi.org/10.25596/jalc-2003-633openalex-snapshot
Rectangle Enclosure Reporting in Linear Space Revisited
inferred← citeshttps://doi.org/10.48550/arxiv.1806.02706openalex-snapshot
Multiobjective Test Problems with Degenerate Pareto Fronts
inferred← citeshttps://doi.org/10.48550/arxiv.2010.12227openalex-snapshot
Geometric Separability using Orthogonal Objects
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.