Optimal Algorithms for Geometric Centers and Depth¶
Optimal Algorithms for Geometric Centers and Depth.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Centerpoint (Geometry)
- The formal distinction matters in computation: finding any guaranteed-balanced location and optimizing the depth are different tasks.
This sourceAbstract checked for distinct centerpoint and Tukey-median computation; its deeper algorithmic claims are not used here.
- The formal distinction matters in computation: finding any guaranteed-balanced location and optimizing the depth are different tasks.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:3045011de66a · see in the full table