On the public citation graph
The orthogonal convex skull problem
0 signed · 24 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/bf00183192openalex-snapshot
On the largest convex polygon contained in a non-convex n-gon, or how to peel a potato
inferredcites →https://doi.org/10.1007/bf02187692openalex-snapshot
A polynomial solution for the potato-peeling problem
inferredcites →https://doi.org/10.1016/0020-0255(84)90025-2openalex-snapshot
On the definition and computation of rectilinear convex hulls
inferredcites →https://doi.org/10.1109/sfcs.1984.715942openalex-snapshot
A Polynomial Solution For Potato-Peeling And Other Polygon Inclusion And Enclosure Problems
inferredcites →https://doi.org/10.1109/t-c.1972.223507openalex-snapshot
Measuring Concavity on a Rectangular Mosaic
inferredcites →https://doi.org/10.1137/0215022openalex-snapshot
Computing the Largest Empty Rectangle
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/11907350_1openalex-snapshot
Duality and Geometry Straightness, Characterization and Envelope
inferred← citeshttps://doi.org/10.1007/3-540-54891-2_21openalex-snapshot
A Generalization of staircase visibility
inferred← citeshttps://doi.org/10.1007/978-3-319-39441-1_17openalex-snapshot
Construction of an Approximate 3D Orthogonal Convex Skull
inferred← citeshttps://doi.org/10.1007/bf01300371openalex-snapshot
Staircase visibility and computation of kernels
inferred← citeshttps://doi.org/10.1007/s00500-025-10568-1openalex-snapshot
Optimization of the rectangle area inside a concave polygon using PSO and Tabu Search
inferred← citeshttps://doi.org/10.1007/s11042-026-21366-8openalex-snapshot
A combinatorial algorithm to compute the triangular convex skull of a digital object
inferred← citeshttps://doi.org/10.1016/0020-0255(94)00053-eopenalex-snapshot
On the area of intersection between two closed 2-D objects
inferred← citeshttps://doi.org/10.1016/0022-0000(89)90043-3openalex-snapshot
Orthogonally convex coverings of orthogonal polygons without holes
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00041-0openalex-snapshot
Finding the largest area axis-parallel rectangle in a polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101710openalex-snapshot
Maximum-area and maximum-perimeter rectangles in polygons
inferred← citeshttps://doi.org/10.1109/34.16713openalex-snapshot
A bibliography on digital and computational convexity (1961-1988)
inferred← citeshttps://doi.org/10.1109/jstars.2020.3026838openalex-snapshot
An Approach to Unsupervised Detection of Fully and Partially Destroyed Buildings in Multitemporal VHR SAR Images
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2019.12openalex-snapshot
Maximum-Area Rectangles in a Simple Polygon
inferred← citeshttps://doi.org/10.70675/fc998e32za59cz4442z8856z6f59253c2a6copenalex-snapshot
Compression multimodale du signal et de l’image en utilisant un seul codeur
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.