On the public citation graph

Projections of 3-polytopes

https://doi.org/10.1007/bf02771563
0 signed · 23 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/bfb0060102openalex-snapshot
On Steinitz's theorem concerning convex 3-polytopes and on some properties of planar graphs
inferredcites →https://doi.org/10.1016/s0021-9800(67)80055-3openalex-snapshot
An enumeration of simplicial 4-polytopes with 8 vertices
inferredcites →https://doi.org/10.1090/pspum/007/0153005openalex-snapshot
On polyhedral graphs
inferredcites →https://doi.org/10.2140/pjm.1970.32.299openalex-snapshot
Preassigning the shape of a face

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-0348-5765-9_5openalex-snapshot
Neuere Entwicklungen in der kombinatorischen Konvexgeometrie
inferred← citeshttps://doi.org/10.1007/bf01818690openalex-snapshot
Dense sets of polytopes inP 3
inferred← citeshttps://doi.org/10.1007/bf02760509openalex-snapshot
Construction theorems for polytopes
inferred← citeshttps://doi.org/10.1007/bf02807248openalex-snapshot
A non-geometric shelling of a 3-polytope
inferred← citeshttps://doi.org/10.1007/s00454-011-9375-3openalex-snapshot
Weakly Regular Subdivisions
inferred← citeshttps://doi.org/10.1016/0012-365x(79)90098-0openalex-snapshot
An invertable 3-diagram with 8 vertices
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00380-2openalex-snapshot
Shadow-boundaries of convex bodies
inferred← citeshttps://doi.org/10.1016/0097-3165(86)90099-3openalex-snapshot
Preassigning the shape of projections of convex polytopes
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50020-8openalex-snapshot
10.1016/b978-044488002-4/50020-8
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00023-5openalex-snapshot
How good are convex hull algorithms?
inferred← citeshttps://doi.org/10.1080/00029890.1972.11993148openalex-snapshot
How to Cut All Edges of a Polytope?
inferred← citeshttps://doi.org/10.1090/pcms/013/10openalex-snapshot
Convex polytopes: Extremal constructions and 𝑓-vector shapes
inferred← citeshttps://doi.org/10.1090/s0002-9904-1970-12601-5openalex-snapshot
Polytopes, graphs, and complexes
inferred← citeshttps://doi.org/10.1090/s1079-6762-04-00137-4openalex-snapshot
Projected products of polygons
inferred← citeshttps://doi.org/10.1112/s0025579300005593openalex-snapshot
Sections and projections of convex polytopes
inferred← citeshttps://doi.org/10.1112/s0025579300009931openalex-snapshot
Shadow‐boundaries and cuts of convex polytopes
inferred← citeshttps://doi.org/10.1145/73393.73431openalex-snapshot
Arrangements of lines in 3-space: a data structure with applications
inferred← citeshttps://doi.org/10.2140/pjm.1976.65.97openalex-snapshot
On facets with non-arbitrary shapes
inferred← citeshttps://doi.org/10.48550/arxiv.math/0411400openalex-snapshot
Convex Polytopes: Extremal Constructions and f-Vector Shapes
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.