On the public citation graph
On the X-Y convex hull of a set of X-Y polygons
0 signed · 52 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/0734-189x(84)90139-7openalex-snapshot
Minimal rectangular partitions of digitized blobs
inferredcites →https://doi.org/10.1016/s0167-9260(83)80019-4openalex-snapshot
An algorithm for optimal two-dimensional compaction of VLSI layouts
inferredcites →https://doi.org/10.1109/t-c.1972.223507openalex-snapshot
Measuring Concavity on a Rectangular Mosaic
inferredcites →https://doi.org/10.1109/tcad.1983.1270022openalex-snapshot
An Algorithm to Compact a VLSI Symbolic Layout with Mixed Constraints
inferredcites →https://doi.org/10.1145/321906.321910openalex-snapshot
On Finding the Maxima of a Set of Vectors
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-54891-2_21openalex-snapshot
A Generalization of staircase visibility
inferred← citeshttps://doi.org/10.1007/3-540-55488-2_26openalex-snapshot
Restricted orientation computational geometry
inferred← citeshttps://doi.org/10.1007/978-3-031-43587-4_3openalex-snapshot
The Rectilinear Convex Hull of Line Segments
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-18849-7openalex-snapshot
Restricted-Orientation Convexity
inferred← citeshttps://doi.org/10.1007/bf01237603openalex-snapshot
Generalized halfspaces in restricted-orientation convexity
inferred← citeshttps://doi.org/10.1007/bf01300371openalex-snapshot
Staircase visibility and computation of kernels
inferred← citeshttps://doi.org/10.1007/bf01758761openalex-snapshot
A linear-time algorithm to construct a rectilinear Steiner minimal tree fork-extremal point sets
inferred← citeshttps://doi.org/10.1007/bfb0009476openalex-snapshot
Applications of a numbering scheme for polygonal obstacles in the plane
inferred← citeshttps://doi.org/10.1007/s10100-008-0074-yopenalex-snapshot
Optimization on directionally convex sets
inferred← citeshttps://doi.org/10.1007/s10898-020-00953-5openalex-snapshot
Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
inferred← citeshttps://doi.org/10.1007/s10898-022-01238-9openalex-snapshot
Separating bichromatic point sets in the plane by restricted orientation convex hulls
inferred← citeshttps://doi.org/10.1007/s10898-025-01482-9openalex-snapshot
Time-optimal computation of the rectilinear convex hull with arbitrary orientation of sets of segments and circles
inferred← citeshttps://doi.org/10.1007/s10957-026-03041-yopenalex-snapshot
Blaschke and Separation Theorems for Orthogonal Convex Sets and Some Applications
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(84)90058-9openalex-snapshot
The contour problem for rectilinear polygons
inferred← citeshttps://doi.org/10.1016/0020-0255(84)90025-2openalex-snapshot
On the definition and computation of rectilinear convex hulls
inferred← citeshttps://doi.org/10.1016/0020-0255(96)00056-4openalex-snapshot
Fundamentals of Restricted-Orientation Convexity
inferred← citeshttps://doi.org/10.1016/0031-3203(90)90095-3openalex-snapshot
An O(kN.log N) algorithm for decomposing a set of polygons into d-separable components
inferred← citeshttps://doi.org/10.1016/0097-8493(89)90081-2openalex-snapshot
SEPARATION™ in d dimensions or strip mining in asteroid fields
inferred← citeshttps://doi.org/10.1016/0734-189x(85)90096-9openalex-snapshot
Picture processing: 1984
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90045-9openalex-snapshot
Optimal computation of finitely oriented convex hulls
inferred← citeshttps://doi.org/10.1016/0925-7721(91)90002-vopenalex-snapshot
Parallel rectilinear shortest paths with rectangular obstacles
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90004-popenalex-snapshot
On parallel rectilinear obstacle- avoiding paths
inferred← citeshttps://doi.org/10.1016/b978-0-444-70467-2.50015-1openalex-snapshot
Ortho-Convexity and its Generalizations
inferred← citeshttps://doi.org/10.1016/b978-0-444-87806-9.50020-7openalex-snapshot
An Isothetic View of Computational Geometry
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.dam.2018.11.009openalex-snapshot
Set-valued games and mixed-strategy equilibria in discounted supergames
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.02.013openalex-snapshot
Realistic roofs without local minimum edges over a rectilinear polygon
inferred← citeshttps://doi.org/10.1023/a:1004973709260openalex-snapshot
Strong Restricted-Orientation Convexity
inferred← citeshttps://doi.org/10.1109/34.16713openalex-snapshot
A bibliography on digital and computational convexity (1961-1988)
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/tc.1987.1676904openalex-snapshot
Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles
inferred← citeshttps://doi.org/10.1112/mtk.70021openalex-snapshot
On orthogonal and staircase connectedness in the plane
inferred← citeshttps://doi.org/10.1117/12.216441openalex-snapshot
Three-dimensional strong convexity and visibility
inferred← citeshttps://doi.org/10.1137/0216049openalex-snapshot
On Some Distance Problems in Fixed Orientations
inferred← citeshttps://doi.org/10.1142/s0218195901000547openalex-snapshot
ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS
inferred← citeshttps://doi.org/10.1145/323233.323258openalex-snapshot
Distance problems in computational geometry with fixed orientations
inferred← citeshttps://doi.org/10.1145/97444.97694openalex-snapshot
Parallel rectilinear shortest paths with rectangular obstacles
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.24867/meta.2024.01openalex-snapshot
ON THE COMPUTATION OF THE ORTHOGONAL HULL OF SIMPLE RECTILINEAR POLYGONS
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.