On the public citation graph

The maximum size of a convex polygon in a restricted set of points in the plane

https://doi.org/10.1007/bf02187725
0 signed · 22 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-0-8176-4842-8_3openalex-snapshot
A Combinatorial Problem in Geometry
inferredcites →https://doi.org/10.1080/00029890.1951.11999682openalex-snapshot
Geometrical Extrema Suggested by a Lemma of Besicovitch
inferredcites →https://doi.org/10.1515/9781400876082openalex-snapshot
Enjoyment of Mathematics
inferredcites →https://doi.org/10.2307/2315998openalex-snapshot
Combinatorial Geometry in the Plane.
inferredcites →https://doi.org/10.4153/cmb-1983-077-8openalex-snapshot
Sets with No Empty Convex 7-Gons

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_33openalex-snapshot
The Visible Perimeter of an Arrangement of Disks
inferred← citeshttps://doi.org/10.1007/bf01844852openalex-snapshot
Lines, line-point incidences and crossing families in dense sets
inferred← citeshttps://doi.org/10.1007/bf02187831openalex-snapshot
Convex independent sets and 7-holes in restricted planar point sets
inferred← citeshttps://doi.org/10.1007/pl00009291openalex-snapshot
Cutting dense point sets in half
inferred← citeshttps://doi.org/10.1007/s00454-004-1089-3openalex-snapshot
Dense Point Sets Have Sparse Delaunay Triangulations or ?... But Not Too Nasty?
inferred← citeshttps://doi.org/10.1007/s00454-007-1334-7openalex-snapshot
Ball-Polyhedra
inferred← citeshttps://doi.org/10.1007/s00454-017-9931-6openalex-snapshot
Point Sets with Small Integer Coordinates and No Large Convex Polygons
inferred← citeshttps://doi.org/10.1007/s00454-023-00561-6openalex-snapshot
Fixing a Hole
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50018-3openalex-snapshot
Problems in Discrete and Combinatorial Geometry
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.08.006openalex-snapshot
The visible perimeter of an arrangement of disks
inferred← citeshttps://doi.org/10.1090/s0273-0979-00-00877-6openalex-snapshot
The Erdos-Szekeres problem on points in convex position – a survey
inferred← citeshttps://doi.org/10.1145/177424.177648openalex-snapshot
Cutting dense point sets in half
inferred← citeshttps://doi.org/10.19086/aic.2025.1openalex-snapshot
Convex polytopes in restricted point sets in R^d
inferred← citeshttps://doi.org/10.48550/arxiv.1010.0630openalex-snapshot
Performance of wireless network coding: motivating small encoding numbers
inferred← citeshttps://doi.org/10.48550/arxiv.2204.02487openalex-snapshot
Convex polytopes in restricted point sets in $\mathbb{R}^d$
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0110030openalex-snapshot
Dense point sets have sparse Delaunay triangulations
inferred← citeshttps://doi.org/10.5555/545381.545397openalex-snapshot
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
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.