On the public citation graph
On simultaneous inner and outer approximation of shapes
0 signed · 43 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-0348-5858-8_7openalex-snapshot
Approximation of convex bodies
inferredcites →https://doi.org/10.1007/978-3-662-01206-2openalex-snapshot
Lagerungen in der Ebene, auf der Kugel und im Raum
inferredcites →https://doi.org/10.1007/bf01240785openalex-snapshot
�ber die affine Exzentrizit�t konvexer K�rper
inferredcites →https://doi.org/10.1007/bf01758852openalex-snapshot
On simultaneous inner and outer approximation of shapes
inferredcites →https://doi.org/10.1007/bf01758853openalex-snapshot
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
inferredcites →https://doi.org/10.1109/sfcs.1979.28openalex-snapshot
On a general method for maximizing and minimizing among certain geometric problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4166610openalex-extracted
Largest Similar Copies of Convex Polygons in Polygonal Domains
inferred← citeshttps://doi.org/10.1007/3-540-40053-2_41openalex-snapshot
Shape Similarity Measures, Properties and Constructions
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_48openalex-snapshot
Optimal Polygon Cover Problems and Applications
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_15openalex-snapshot
Property Testing in Computational Geometry
inferred← citeshttps://doi.org/10.1007/3-540-55488-2_20openalex-snapshot
Selected topics from computational geometry, data structures and motion planning
inferred← citeshttps://doi.org/10.1007/978-3-540-30540-8_11openalex-snapshot
On a Triangle with the Maximum Area in a Planar Point Set
inferred← citeshttps://doi.org/10.1007/978-3-642-04397-0_5openalex-snapshot
Efficient Lattice Width Computation in Arbitrary Dimension
inferred← citeshttps://doi.org/10.1007/978-3-662-03039-4_29openalex-snapshot
Recognition of Affine Planar Curves Using Geometric Properties
inferred← citeshttps://doi.org/10.1007/bf02238642openalex-snapshot
The convergence rate of the sandwich algorithm for approximating convex functions
inferred← citeshttps://doi.org/10.1007/s00010-018-0565-4openalex-snapshot
On Banach–Mazur distance between planar convex bodies
inferred← citeshttps://doi.org/10.1007/s00025-023-01898-3openalex-snapshot
Approximation of Quadrilaterals by Triangles with Respect to Minimal Width
inferred← citeshttps://doi.org/10.1007/s00453-001-0096-5openalex-snapshot
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-024-00641-1openalex-snapshot
On the Banach–Mazur Distance in Small Dimensions
inferred← citeshttps://doi.org/10.1007/s11590-015-0941-0openalex-snapshot
Inner and outer approximation of convex sets using alignment
inferred← citeshttps://doi.org/10.1007/s13366-011-0026-xopenalex-snapshot
Approximation of convex bodies by inscribed simplices of maximum volume
inferred← citeshttps://doi.org/10.1007/s40590-018-0193-yopenalex-snapshot
A conjecture on line transversals to five unit discs
inferred← citeshttps://doi.org/10.1016/j.aml.2006.01.006openalex-snapshot
On the maximum area pentagon in a planar point set
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101612openalex-snapshot
On the shortest separating cycle
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101742openalex-snapshot
Largest and smallest area triangles on imprecise points
inferred← citeshttps://doi.org/10.1016/j.comgeo.2021.101792openalex-snapshot
Largest triangles in a polygon
inferred← citeshttps://doi.org/10.1016/j.disc.2011.05.006openalex-snapshot
On an empty triangle with the maximum area in planar point sets
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.06.023openalex-snapshot
Modeling time and topology for animation and visualization with examples on parametric geometry
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.02.009openalex-snapshot
Computing efficiently the lattice width in any dimension
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115685openalex-snapshot
Largest similar copies of convex polygons in polygonal domains
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00019-3openalex-snapshot
Approximation of convex figures by pairs of rectangles
inferred← citeshttps://doi.org/10.1090/s0002-9939-02-06404-3openalex-snapshot
Approximation of convex bodies by axially symmetric bodies
inferred← citeshttps://doi.org/10.1137/1.9781611973099.3openalex-snapshot
Polytope Approximation and the Mahler Volume
inferred← citeshttps://doi.org/10.1142/s0218195902000918openalex-snapshot
OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS
inferred← citeshttps://doi.org/10.1145/276884.276920openalex-snapshot
Efficiently approximating polygonal paths in three and higher dimensions
inferred← citeshttps://doi.org/10.20382/jocg.v5i1a2openalex-snapshot
The Hausdorff core problem on simple polygons
inferred← citeshttps://doi.org/10.4171/em/91openalex-snapshot
On maximum area polygons in a planar point set
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2021.19openalex-snapshot
Largest Similar Copies of Convex Polygons in Polygonal Domains
inferred← citeshttps://doi.org/10.48550/arxiv.2104.12172openalex-snapshot
On the maximum area of inscribed polygons
showing the first 35 of 36 · page through all 36
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.