On the public citation graph
Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
0 signed · 38 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.1016/0196-6774(80)90011-5openalex-snapshot
Finding the contour of a union of iso-oriented rectangies
inferredcites →https://doi.org/10.1016/0196-6774(84)90013-0openalex-snapshot
An optimal contour algorithm for iso-oriented rectangles
inferredcites →https://doi.org/10.1016/0196-6774(84)90027-0openalex-snapshot
Optimal algorithms to compute the closure of a set of iso-rectangles
inferredcites →https://doi.org/10.1049/ip-i-1.1981.0010openalex-snapshot
Introduction to V.L.S.I. Systems
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.1109/tc.1979.1675432openalex-snapshot
Algorithms for Reporting and Counting Geometric Intersections
inferredcites →https://doi.org/10.1109/tc.1980.1675628openalex-snapshot
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
inferredcites →https://doi.org/10.1109/tc.1984.5009341openalex-snapshot
Finding Rectangle Intersections by Divide-and-Conquer
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-50335-8_26openalex-snapshot
Internal and external algorithms for the points-in-regions problem — the INSIDE join of geo-relational algebra
inferred← citeshttps://doi.org/10.1007/978-3-030-85569-7_23-1openalex-snapshot
Live Cell Imaging by High-Resolution Quasi-Spectral Microscopy
inferred← citeshttps://doi.org/10.1007/978-3-031-91544-4_23openalex-snapshot
Live Cell Imaging by High-Resolution Quasi-Spectral Microscopy
inferred← citeshttps://doi.org/10.1007/978-3-540-85221-6_12openalex-snapshot
Combinatorial Problems in Chip Design
inferred← citeshttps://doi.org/10.1007/bf01421677openalex-snapshot
A parallel algorithm to construct a dominance graph on nonoverlapping rectangles
inferred← citeshttps://doi.org/10.1007/bf01758750openalex-snapshot
Parallel computational geometry of rectangles
inferred← citeshttps://doi.org/10.1007/bf01758844openalex-snapshot
On the parallel-decomposability of geometric problems
inferred← citeshttps://doi.org/10.1007/bf01840388openalex-snapshot
Internal and external algorithms for the points-in-regions problem—the inside join of geo-relational algebra
inferred← citeshttps://doi.org/10.1016/0020-0190(84)90058-9openalex-snapshot
The contour problem for rectilinear polygons
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90159-1openalex-snapshot
Time- and space-optimal contour computation for a set of rectangles
inferred← citeshttps://doi.org/10.1016/0020-0255(87)90018-1openalex-snapshot
A practical divide-and-conquer algorithm for the rectangle intersection problem
inferred← citeshttps://doi.org/10.1016/0167-8191(90)90119-topenalex-snapshot
An optimal speedup algorithm for the measure problem
inferred← citeshttps://doi.org/10.1016/0734-189x(85)90096-9openalex-snapshot
Picture processing: 1984
inferred← citeshttps://doi.org/10.1016/0734-189x(86)90049-6openalex-snapshot
Computation of geometric properties from the medial axis transform in (O(nlogn) time
inferred← citeshttps://doi.org/10.1016/0734-189x(88)90106-5openalex-snapshot
Parallel computation of geometric properties from the medial axis transform
inferred← citeshttps://doi.org/10.1016/0743-7315(88)90026-3openalex-snapshot
Optimal algorithms for rectangle problems on a mesh-connected computer
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80011-xopenalex-snapshot
Dynamic C-oriented polygonal intersection searching
inferred← citeshttps://doi.org/10.1080/00207168608803493openalex-snapshot
Divide-and-conquer in planar geometry
inferred← citeshttps://doi.org/10.1109/5.163411openalex-snapshot
The contour problem for restricted-orientation polygons
inferred← citeshttps://doi.org/10.1109/secon.1991.147823openalex-snapshot
Parallel algorithm for direct domination on nonoverlapping rectangles
inferred← citeshttps://doi.org/10.1109/secon.1992.202301openalex-snapshot
A parallel algorithm for maximum independent set of a circular-arc graph
inferred← citeshttps://doi.org/10.1109/spdp.1993.395531openalex-snapshot
Parallel algorithms for geometric problems on networks of processors
inferred← citeshttps://doi.org/10.1109/tc.1984.1676388openalex-snapshot
Computational Geometry—A Survey
inferred← citeshttps://doi.org/10.1109/tc.1984.5009341openalex-snapshot
Finding Rectangle Intersections by Divide-and-Conquer
inferred← citeshttps://doi.org/10.1145/128903.128905openalex-snapshot
Rule-based optimization and query processing in an extensible geometric database system
inferred← citeshttps://doi.org/10.1145/73833.73845openalex-snapshot
On the parallel decomposability of geometric problems
inferred← citeshttps://doi.org/10.1212/wnl.51.1.20openalex-snapshot
Complex regional pain syndrome type I (RSD)
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.