On the public citation graph
On the largest convex polygon contained in a non-convex n-gon, or how to peel a potato
0 signed · 37 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/978-3-642-47404-0openalex-snapshot
Theorie der Konvexen Körper
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/978-3-030-83508-8_19openalex-snapshot
Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-031-22105-7_5openalex-snapshot
Large k-Gons in a 1.5D Terrain
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_24openalex-snapshot
Convex Polygons in Geometric Triangulations
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/978-3-642-32060-6_18openalex-snapshot
Real Time Biped Walking Gait Pattern Generator for a Real Robot
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_20openalex-snapshot
How Many Potatoes Are in a Mesh?
inferred← citeshttps://doi.org/10.1007/bf01250002openalex-snapshot
Lattice-theoretical fixpoint theorems in morphological image filtering
inferred← citeshttps://doi.org/10.1007/bf02187692openalex-snapshot
A polynomial solution for the potato-peeling problem
inferred← citeshttps://doi.org/10.1007/bf02187918openalex-snapshot
The orthogonal convex skull problem
inferred← citeshttps://doi.org/10.1007/s00371-023-03170-9openalex-snapshot
Obtaining the user-defined polygons inside a closed contour with holes
inferred← citeshttps://doi.org/10.1007/s00454-016-9821-3openalex-snapshot
On the Beer Index of Convexity and Its Variants
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/b978-0-444-87806-9.50020-7openalex-snapshot
An Isothetic View of Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.automatica.2012.09.012openalex-snapshot
Spatially distributed area coverage optimisation in mobile robotic networks with arbitrary convex anisotropic patterns
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101710openalex-snapshot
Maximum-area and maximum-perimeter rectangles in polygons
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102171openalex-snapshot
Finding a largest-area triangle in a terrain in near-linear time
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.12.018openalex-snapshot
Largest triangle inside a terrain
inferred← citeshttps://doi.org/10.1017/s0963548317000141openalex-snapshot
Convex Polygons in Geometric Triangulations
inferred← citeshttps://doi.org/10.1109/34.16713openalex-snapshot
A bibliography on digital and computational convexity (1961-1988)
inferred← citeshttps://doi.org/10.1109/pc.2013.6581395openalex-snapshot
Towards a dominant-polytope complexity reduction in explicit MPC
inferred← citeshttps://doi.org/10.1109/secon.1988.194879openalex-snapshot
Best regular enclosures for triangles
inferred← citeshttps://doi.org/10.1137/16m1079695openalex-snapshot
Peeling Potatoes Near-Optimally in Near-Linear Time
inferred← citeshttps://doi.org/10.1137/22m1482676openalex-snapshot
An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest
inferred← citeshttps://doi.org/10.1142/s0219843611002447openalex-snapshot
A UNIVERSAL BIPED WALKING GENERATOR FOR COMPLEX ENVIRONMENTS WITH PATTERN FEASIBILITY CHECKING
inferred← citeshttps://doi.org/10.1145/2582112.2582159openalex-snapshot
Peeling Potatoes Near-Optimally in Near-Linear Time
inferred← citeshttps://doi.org/10.1145/323233.323273openalex-snapshot
Computing a convex skill of an orthogonal polygon
inferred← citeshttps://doi.org/10.2316/p.2012.781-033openalex-snapshot
Coordination of Mobile Networks with Arbitrary Convex Sensing Patterns
inferred← citeshttps://doi.org/10.3390/s18072284openalex-snapshot
Optimal Camera Pose and Placement Configuration for Maximum Field-of-View Video Stitching
inferred← citeshttps://doi.org/10.48550/arxiv.1209.3954openalex-snapshot
How Many Potatoes are in a Mesh?
inferred← citeshttps://doi.org/10.48550/arxiv.2002.06777openalex-snapshot
Fitting ARMA Time Series Models without Identification: A Proximal Approach
inferred← citeshttps://doi.org/10.5555/1109557.1109610openalex-snapshot
Finding large sticks and potatoes in 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.