On the public citation graph

Parallel computational geometry of rectangles

https://doi.org/10.1007/bf01758750
0 signed · 44 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/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bf00264251openalex-snapshot
Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
inferredcites →https://doi.org/10.1007/bf01759065openalex-snapshot
Finding a minimal cover for binary images: An optimal parallel algorithm
inferredcites →https://doi.org/10.1007/bf01762120openalex-snapshot
Parallel computational geometry
inferredcites →https://doi.org/10.1007/bf01840440openalex-snapshot
Fractional cascading: I. A data structuring technique
inferredcites →https://doi.org/10.1016/0019-1035(71)90137-0openalex-snapshot
Picture processing by computer
inferredcites →https://doi.org/10.1016/0021-9924(68)90015-4openalex-snapshot
Models for the perception of speech and visual form
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(81)90027-4openalex-snapshot
The measure problem for rectangular ranges in d-space
inferredcites →https://doi.org/10.1016/0196-6774(83)90012-3openalex-snapshot
Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
inferredcites →https://doi.org/10.1016/0196-6774(83)90044-5openalex-snapshot
Problems
inferredcites →https://doi.org/10.1016/0734-189x(88)90106-5openalex-snapshot
Parallel computation of geometric properties from the medial axis transform
inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50020-7openalex-snapshot
An Isothetic View of Computational Geometry
inferredcites →https://doi.org/10.1109/sfcs.1979.22openalex-snapshot
Locking policies: Safety and freedom from deadlock
inferredcites →https://doi.org/10.1109/sfcs.1986.41openalex-snapshot
Parallel merge sort
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.1985.6312202openalex-snapshot
The power of parallel prefix
inferredcites →https://doi.org/10.1137/0218035openalex-snapshot
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
inferredcites →https://doi.org/10.1145/10515.10539openalex-snapshot
Efficient plane sweeping in parallel
inferredcites →https://doi.org/10.1145/12130.12151openalex-snapshot
Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms
inferredcites →https://doi.org/10.1145/359545.359553openalex-snapshot
On the complexity of computing the measure of ∪[a i ,b i ]
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.1006/cviu.1998.0741openalex-snapshot
Optimal Computing the Chessboard Distance Transform on Parallel Processing Systems
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_164openalex-snapshot
Efficient parallel algorithms for geometric k-clustering problems
inferred← citeshttps://doi.org/10.1007/978-3-319-59108-7_10openalex-snapshot
Algorithms for Stable Matching and Clustering in a Grid
inferred← citeshttps://doi.org/10.1007/978-3-540-69501-1_11openalex-snapshot
3D Block-Based Medial Axis Transform and Chessboard Distance Transform on the CREW PRAM
inferred← citeshttps://doi.org/10.1007/bf01250524openalex-snapshot
Constant time BSR solutions to L1 metric and digital geometry problems
inferred← citeshttps://doi.org/10.1007/bf02684474openalex-snapshot
Medial axis transform on mesh-connected computers with hyperbus broadcasting
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90046-zopenalex-snapshot
Parallel algorithms for the segment dragging problem
inferred← citeshttps://doi.org/10.1016/j.imavis.2010.11.005openalex-snapshot
3D block-based medial axis transform and chessboard distance transform based on dominance
inferred← citeshttps://doi.org/10.1016/j.parco.2008.10.003openalex-snapshot
A novel time algorithm for 3D block-based medial axis transform by peeling corner shells
inferred← citeshttps://doi.org/10.1029/2007wr006641openalex-snapshot
Simulating drainage and imbibition experiments in a high‐porosity micromodel using an unstructured pore network model
inferred← citeshttps://doi.org/10.1080/00207169708804608openalex-snapshot
The equivalence of the chessboard distance transform and the medial axis transform∗
inferred← citeshttps://doi.org/10.1080/01495730108935276openalex-snapshot
EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS*
inferred← citeshttps://doi.org/10.1109/34.177389openalex-snapshot
Serial and parallel algorithms for the medial axis transform
inferred← citeshttps://doi.org/10.1109/icapp.1996.562850openalex-snapshot
A simple parallel algorithm for the medial axis transform of binary images
inferred← citeshttps://doi.org/10.1109/icpads.1996.517598openalex-snapshot
Fast parallel chessboard distance transform algorithms
inferred← citeshttps://doi.org/10.1109/icpads.2002.1183388openalex-snapshot
Parallel algorithms for the medial axis transform on linear arrays with a reconfigurable pipelined bus system
inferred← citeshttps://doi.org/10.1109/icsmc.2005.1571709openalex-snapshot
Fast Algorithms for Block-Based Medial Axis Transform on the LARPBS
inferred← citeshttps://doi.org/10.1109/ipps.1992.223025openalex-snapshot
Serial and parallel algorithms for the medial axis transform
inferred← citeshttps://doi.org/10.1109/ipps.1996.508090openalex-snapshot
The chessboard distance transform and the medial axis transform are interchangeable
inferred← citeshttps://doi.org/10.1109/ispan.1996.508956openalex-snapshot
Optimal parallel algorithms for computing the chessboard distance transform and the medial axis transform on RAP
inferred← citeshttps://doi.org/10.1117/12.165010openalex-snapshot
Solving city block metric and digital geometry problems on the BSR model of parallel computation
inferred← citeshttps://doi.org/10.3390/land12091655openalex-snapshot
The Land-Use and Land-Cover Changes in the Este District, South Gondar Zone, Northwestern Ethiopia, in the Last Four Decades (the 1980s to 2020s)
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.