On the public citation graph

The Smallest Covering Cone or Sphere

0 signed · 16 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 points at this work

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

inferred← citeshttps://doi.org/10.1007/bf01581243openalex-snapshot
Computational complexity of inner and outerj-radii of polytopes in finite-dimensional normed spaces
inferred← citeshttps://doi.org/10.1007/s10898-005-6017-4openalex-snapshot
Hausdorff Matching and Lipschitz Optimization
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90179-8openalex-snapshot
An adaptive algorithm for finding a covering hypersphere
inferred← citeshttps://doi.org/10.1016/0097-8493(85)90035-4openalex-snapshot
Efficient algorithms for automatic viewer orientation
inferred← citeshttps://doi.org/10.1016/j.cad.2012.07.014openalex-snapshot
An accurate and efficient algorithm for determining minimum circumscribed circles and spheres from discrete data points
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.09.019openalex-snapshot
Optimal bounding cones of vectors in three dimensions
inferred← citeshttps://doi.org/10.1080/05695558308974651openalex-snapshot
Constrained Location Problems in the Plane and on a Sphere
inferred← citeshttps://doi.org/10.1109/wts.2013.6566250openalex-snapshot
K-centers Min-Max clustering algorithm over heterogeneous wireless sensor networks
inferred← citeshttps://doi.org/10.1111/1467-8659.1230261openalex-snapshot
The Cone of Normals Technique for Fast Processing of Curved Patches
inferred← citeshttps://doi.org/10.1111/cgf.12714openalex-snapshot
Real‐Time Rendering Techniques with Hardware Tessellation
inferred← citeshttps://doi.org/10.1137/070690419openalex-snapshot
Two Algorithms for the Minimum Enclosing Ball Problem
inferred← citeshttps://doi.org/10.1287/mnsc.19.1.96openalex-snapshot
The Minimum Covering Sphere Problem
inferred← citeshttps://doi.org/10.1287/opre.30.4.777openalex-snapshot
Efficient Algorithms for the (Weighted) Minimum Circle Problem
inferred← citeshttps://doi.org/10.1287/trsc.6.4.379openalex-snapshot
Geometrical Solutions for Some Minimax Location Problems
inferred← citeshttps://doi.org/10.2312/egst.20141037openalex-snapshot
State of the Art Report on Real-time Rendering with Hardware Tessellation
inferred← citeshttps://doi.org/10.3929/ethz-a-005084315openalex-snapshot
Smallest enclosing balls of balls: Combinatorial structure & algorithms
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.