Contextual Farthest-Point Anchoring (CFPA)

• CFPA is a family of anchoring methods that adapts farthest-point sampling by incorporating context like saliency, temporal coherence, and obstacle awareness to robustly preserve critical features.
• In video processing, CFPA preserves exact visual tokens by combining saliency, context agreement, and feature coverage, achieving significant efficiency gains such as up to 12.99x TFLOPs reduction.
• In graph and localization applications, CFPA balances farthest dispersion with geometry-aware criteria, delivering provable stretch bounds and enhanced certification even with bounded measurement errors.

Contextual Farthest-Point Anchoring (CFPA) is a farthest-point-based anchoring paradigm in which anchor selection is conditioned by an explicit notion of context rather than by separation alone. In the literature represented here, the term is used most explicitly for the skeleton-preservation module of GeoTrace, where it retains exact visual tokens that are salient, context-consistent across a local temporal chunk, and high-coverage in feature space (Xie et al., 10 Jul 2026). Related uses map the same anchoring logic to exact farthest-neighbor retrieval under geodesic $L_1$ distance in the presence of rectangular obstacles (Kim et al., 2022), to anchor-based approximation of graph geodesics via farthest point sampling (FPS) (Kamousi et al., 2013), and to geometry-aware anchor subset selection and certification for range-based localization under unknown-but-bounded errors (Calafiore, 15 Mar 2026). Across these settings, the common structure is the use of anchors chosen under a max–min or spread-seeking principle, with the surrounding notion of context supplied by temporal coherence, obstacle-aware reachability, graph geodesics, or localization geometry.

1. Conceptual scope and common structure

The term does not denote one universal algorithm in the supplied literature; rather, it denotes a family of anchor-selection procedures in which a farthest-point principle is modulated by application-specific constraints. In GeoTrace, the relevant context is chunk-local video semantics, encoded through saliency and chunk-level context agreement. In obstacle-aware geometry, context is induced by free space, rectangular obstacles, and directional reachability. In graph-geodesic approximation, anchors are FPS sources through which approximate distances are routed. In range-based localization, context is a region $\mathcal R$ or coarse estimate $x_c$, together with geometry-only scores derived from the centered scatter matrix $S(A)$ (Xie et al., 10 Jul 2026).

A recurrent misconception is to identify CFPA with classical farthest-point sampling. That identification is incomplete. Classical FPS iteratively selects the point farthest from the already selected set in the underlying metric. By contrast, the GeoTrace formulation multiplies feature-space separation by saliency and chunk-context consistency on the candidate side; the localization formulation augments farthest dispersion with E- and D-type geometry criteria; and the obstacle formulation uses exact geodesic $L_1$ farthest-neighbor structure rather than a greedy sampling routine. This suggests that “contextual” in CFPA is not rhetorical terminology but the part of the method that changes the admissible anchor set, the objective, or the certification mechanism.

The notion of an anchor also changes with the domain. In Video LLM compression, anchors are retained skeleton tokens copied verbatim from encoder outputs. In graph and geometric routing, anchors are sources or sites used to answer farthest-neighbor or approximate-distance queries. In localization, anchors are physical ranging nodes whose geometry controls directional width, diameter, and volume surrogates of the certified feasible set. The farthest-point principle is therefore stable across domains, but what is preserved, queried, or certified differs substantially.

2. CFPA as skeleton preservation in GeoTrace

In GeoTrace, CFPA is the skeleton-preservation module of a training-free spatiotemporal token compression framework for Video LLMs. A video chunk consists of $L$ frames, and the visual encoder outputs tokens $$\mathbf{X}=\{\mathbf{x}_{t,i}\in\mathbb{R}^{d}\}_{t=1,i=1}^{T,N}$$. Chunking is local rather than global: adjacent-frame similarity is computed from frame descriptors

$$\bar{\mathbf{x}}_{t}=\frac{1}{N}\sum_{i=1}^{N}\mathbf{x}_{t,i},\qquad s_t=\cos(\bar{\mathbf{x}}_{t},\bar{\mathbf{x}}_{t+1}),$$

and cuts at low $s_t$ form chunks $\{\mathcal C_m\}$. Within each frame $\mathcal R$0 in a chunk, CFPA selects a set $\mathcal R$1 with $\mathcal R$2, and the resulting skeleton features $\mathcal R$3 are exact copies of encoder outputs rather than fused features (Xie et al., 10 Jul 2026).

The module addresses two failure modes identified for prior compression methods. First, saliency-only selection can collapse the retained budget around a few entities and fail to capture a global frame skeleton. Second, heuristic token merging can mix disparate residual tokens and drift off the original feature manifold, weakening discriminability. CFPA responds by preserving exact anchor tokens that jointly cover the chunk-level visual structure and remain consistent with chunk context. The anchors are therefore required to be salient, context-consistent, and high-coverage in feature space.

Its scoring ingredients are explicit. If [CLS] attention is available, CFPA uses it directly; otherwise, token saliency is derived from self-attention: $\mathcal R$4 Chunk-level context agreement is

$\mathcal R$5

and Appendix C.2 writes the same quantity as

$\mathcal R$6

Within a frame, cosine separation is

$\mathcal R$7

and the contextual candidate weighting is

$\mathcal R$8

equivalently,

$\mathcal R$9

The margin used for anchor selection is a context-aware farthest-point bottleneck: $x_c$0 or, in Appendix C.2 notation,

$x_c$1

CFPA’s beam search approximates a context-aware max–min $x_c$2-center variant: $x_c$3 This differs from classical FPS in two ways stated directly in the paper’s exposition: the weighting is on the candidate side, not on distance alone, and the selection is beam-style rather than purely greedy. The practical significance is that CFPA is designed to suppress isolated-frame local peaks while still favoring broad skeleton coverage.

3. Algorithmic pipeline, complexity, and empirical behavior

CFPA operates inside GeoTrace’s chunk-local pipeline. The retained-token budget per frame is split as

$x_c$4

For each frame in the chunk, the algorithm computes frame descriptors, pairwise separations $x_c$5, chunk-context agreement $x_c$6, and weighted separations $x_c$7. It initializes beam candidates using the robust “second-min” score $x_c$8, selects the top-$x_c$9 seeds, and then iteratively expands beams until $S(A)$0. The paper states the dominant CFPA cost over a chunk with $S(A)$1 frames, $S(A)$2 tokens per frame, feature dimension $S(A)$3, beam size $S(A)$4, and skeleton budget $S(A)$5 as

$S(A)$6

with $S(A)$7 float memory for per-frame pairwise separations and candidate margins, and $S(A)$8 for saliency and context arrays (Xie et al., 10 Jul 2026).

The preserved anchors are complemented by Trajectory-Constrained Residual Condensation (TCRC). After CFPA outputs skeleton tokens and indices, the residual mask removes skeleton indices, residual trajectories are built by Hungarian matching between adjacent frames,

$S(A)$9

trajectory features are pooled as

$L_1$0

and spatial condensation is performed with entropy-regularized transport. The output sequence is then assembled by global indices $L_1$1, so that skeleton and event tokens appear in original order before LLM prefill.

The reported design defaults are $L_1$2, $L_1$3, and chunk minimum count $L_1$4. Retention ratios used in experiments are $L_1$5. The ablation study at $L_1$6 shows that the full combination of saliency, context-consistency, and coverage outperforms each partial variant, which directly supports the claim that the three factors are complementary rather than interchangeable.

Variant at $L_1$7	Avg. Score	Rel. Acc.
Saliency-only (Sal.)	56.2	96.2%
Context-only (Cons.)	55.1	94.3%
Coverage-only (Cov.)	56.2	96.2%
w/o Cons.	56.9	97.4%
w/o Sal.	57.2	97.9%
Full CFPA	57.9	99.1%

On LLaVA-OneVision, GeoTrace at $L_1$8 retains 99.1% relative accuracy with a $L_1$9 TFLOPs reduction, from 113.43 to 8.73 TFLOPs, and Avg. Score 57.9 versus vanilla 58.4. The efficiency table also reports TTFT improving from 2007.7ms to 594.4ms. The framework is reported to work across LLaVA-OneVision, LLaVA-Video, Qwen2.5-VL, and Qwen3-VL, including dynamic-resolution processors. A common misconception is that CFPA itself performs token fusion; the paper is explicit that CFPA preserves exact anchors and defers residual compression to TCRC.

4. Obstacle-aware geodesic CFPA under $L$0 distance

An implementation-oriented use of CFPA is given for obstacle-aware farthest-anchor retrieval under geodesic $L$1 distance, based on the results of Kim, Seo, Ahn, and Ahn on farthest-point Voronoi diagrams in the presence of rectangular obstacles. Let $L$2 be a set of axis-aligned rectangular obstacles and define the free space

$L$3

For points $L$4, the geodesic $L$5 distance is the length of a shortest obstacle-avoiding path in $L$6 under the Manhattan metric. For a site set $L$7, the geodesic $L$8 farthest-point Voronoi diagram partitions free space into cells

$L$9

and the farthest-neighbor query returns

$$\mathbf{X}=\{\mathbf{x}_{t,i}\in\mathbb{R}^{d}\}_{t=1,i=1}^{T,N}$$0

Cells may be disconnected because obstacles split reachable regions (Kim et al., 2022).

The construction described in the paper is exact rather than heuristic. Obstacles are $$\mathbf{X}=\{\mathbf{x}_{t,i}\in\mathbb{R}^{d}\}_{t=1,i=1}^{T,N}$$1 pairwise-disjoint open rectangles, sites lie in free space, and a general position assumption excludes points equidistant to four or more distinct sites. The explicit diagram can be constructed in

$$\mathbf{X}=\{\mathbf{x}_{t,i}\in\mathbb{R}^{d}\}_{t=1,i=1}^{T,N}$$2

time using

$$\mathbf{X}=\{\mathbf{x}_{t,i}\in\mathbb{R}^{d}\}_{t=1,i=1}^{T,N}$$3

space, and a farthest-neighbor query data structure with the same preprocessing complexity answers queries in

$$\mathbf{X}=\{\mathbf{x}_{t,i}\in\mathbb{R}^{d}\}_{t=1,i=1}^{T,N}$$4

time. The details emphasize that these bounds are optimal for explicit construction because the diagram has worst-case combinatorial complexity $$\mathbf{X}=\{\mathbf{x}_{t,i}\in\mathbb{R}^{d}\}_{t=1,i=1}^{T,N}$$5, obstacle-related distance computation requires $$\mathbf{X}=\{\mathbf{x}_{t,i}\in\mathbb{R}^{d}\}_{t=1,i=1}^{T,N}$$6, and plane Voronoi construction with $$\mathbf{X}=\{\mathbf{x}_{t,i}\in\mathbb{R}^{d}\}_{t=1,i=1}^{T,N}$$7 sites requires $$\mathbf{X}=\{\mathbf{x}_{t,i}\in\mathbb{R}^{d}\}_{t=1,i=1}^{T,N}$$8.

The structural mechanism is directional. For each site there exist eight obstacle-aware rectilinear $$\mathbf{X}=\{\mathbf{x}_{t,i}\in\mathbb{R}^{d}\}_{t=1,i=1}^{T,N}$$9-monotone traces $$\bar{\mathbf{x}}_{t}=\frac{1}{N}\sum_{i=1}^{N}\mathbf{x}_{t,i},\qquad s_t=\cos(\bar{\mathbf{x}}_{t},\bar{\mathbf{x}}_{t+1}),$$0 for

$$\bar{\mathbf{x}}_{t}=\frac{1}{N}\sum_{i=1}^{N}\mathbf{x}_{t,i},\qquad s_t=\cos(\bar{\mathbf{x}}_{t},\bar{\mathbf{x}}_{t+1}),$$1

and these partition free space into eight regions around the site. This supports four directional farthest-point maps

$$\bar{\mathbf{x}}_{t}=\frac{1}{N}\sum_{i=1}^{N}\mathbf{x}_{t,i},\qquad s_t=\cos(\bar{\mathbf{x}}_{t},\bar{\mathbf{x}}_{t+1}),$$2

each encoding farthest sites reachable by monotone paths in the corresponding direction. Every edge of each $$\bar{\mathbf{x}}_{t}=\frac{1}{N}\sum_{i=1}^{N}\mathbf{x}_{t,i},\qquad s_t=\cos(\bar{\mathbf{x}}_{t},\bar{\mathbf{x}}_{t+1}),$$3 is axis-aligned. Along any horizontal free-space segment, the order of farthest sites is the reverse of the sites’ $$\bar{\mathbf{x}}_{t}=\frac{1}{N}\sum_{i=1}^{N}\mathbf{x}_{t,i},\qquad s_t=\cos(\bar{\mathbf{x}}_{t},\bar{\mathbf{x}}_{t+1}),$$4-order when farthest sites change, implying that any horizontal segment intersects $$\bar{\mathbf{x}}_{t}=\frac{1}{N}\sum_{i=1}^{N}\mathbf{x}_{t,i},\qquad s_t=\cos(\bar{\mathbf{x}}_{t},\bar{\mathbf{x}}_{t+1}),$$5 cells.

The query structure uses these maps directly. For a query point $$\bar{\mathbf{x}}_{t}=\frac{1}{N}\sum_{i=1}^{N}\mathbf{x}_{t,i},\qquad s_t=\cos(\bar{\mathbf{x}}_{t},\bar{\mathbf{x}}_{t+1}),$$6, a vertical ray is shot opposite to the sweep direction in each $$\bar{\mathbf{x}}_{t}=\frac{1}{N}\sum_{i=1}^{N}\mathbf{x}_{t,i},\qquad s_t=\cos(\bar{\mathbf{x}}_{t},\bar{\mathbf{x}}_{t+1}),$$7. If a segment is hit, binary search over the stored boundary points on that segment identifies the farthest site in that directional map, and the maximum across the four directional values yields the farthest anchor set; ties are returned as multiple anchors. If only online queries are needed, the four maps plus per-map vertical ray shooters suffice; if full offline spatial analysis is needed, the method continues with vertical decomposition, x-monotone bisector traces between maps, zone partitioning, and gluing to produce the full geodesic $$\bar{\mathbf{x}}_{t}=\frac{1}{N}\sum_{i=1}^{N}\mathbf{x}_{t,i},\qquad s_t=\cos(\bar{\mathbf{x}}_{t},\bar{\mathbf{x}}_{t+1}),$$8 farthest-point Voronoi diagram.

5. Graph-geodesic anchoring and the FPS connection

A graph-theoretic use of CFPA appears as an anchor-selection and distance-approximation scheme built on top of the analysis of FPS for approximating geodesics in a weighted graph or triangle mesh. Let $$\bar{\mathbf{x}}_{t}=\frac{1}{N}\sum_{i=1}^{N}\mathbf{x}_{t,i},\qquad s_t=\cos(\bar{\mathbf{x}}_{t},\bar{\mathbf{x}}_{t+1}),$$9 be connected with positive edge lengths in $s_t$0, and let

$s_t$1

FPS selects $s_t$2 anchors by choosing a random first source and then iteratively selecting the vertex maximizing its distance to the current source set. Once the anchors $s_t$3 are fixed, approximate distance between vertices $s_t$4 and $s_t$5 is computed by routing through one anchor: $s_t$6 The paper analyzes the resulting stretch factor

$s_t$7

and denotes by $s_t$8 the stretch achieved by FPS and by $s_t$9 the minimum stretch over all $\{\mathcal C_m\}$0-anchor choices (Kamousi et al., 2013).

The main theoretical result is

$\{\mathcal C_m\}$1

For near-uniform edge lengths, $\{\mathcal C_m\}$2, the bound becomes roughly $\{\mathcal C_m\}$3; for highly non-uniform graphs, the quadratic dependence on $\{\mathcal C_m\}$4 dominates. The paper also proves that finding $\{\mathcal C_m\}$5 sources minimizing the stretch factor is NP-complete. The practical implication is explicit: optimal anchor placement minimizing stretch is computationally intractable in general, so FPS is justified as a heuristic with a provable bound relative to $\{\mathcal C_m\}$6 and the mesh irregularity parameter $\{\mathcal C_m\}$7.

The analysis contains an evaluation result that is especially relevant for anchor-based systems. For any fixed sources and any given $\{\mathcal C_m\}$8, the maximum ratio

$\{\mathcal C_m\}$9

is realized for some $\mathcal R$00 adjacent to $\mathcal R$01. Consequently, the global worst-case stretch can be found by scanning adjacent pairs rather than all pairs. This gives a theoretically justified protocol for empirical CFPA evaluation on graphs: choose anchors with FPS, precompute source-to-all distances, and measure empirical stretch on edges. Precomputation requires $\mathcal R$02 single-source shortest-path computations, which the exposition states as $\mathcal R$03 on general graphs and $\mathcal R$04 on planar triangle graphs using linear-time SSSP; storage is $\mathcal R$05.

This graph formulation clarifies what CFPA is not. It is not a multi-hop landmark routing scheme in the cited analysis, and it is not a certificate of global optimality. Its role is to provide a principled anchor set through FPS and to use those anchors for fast approximate geodesic queries with a worst-case stretch bound.

6. Geometry-aware localization, certification, and limits of farthest-only selection

In range-based localization under unknown-but-bounded measurement errors, CFPA is formulated as a geometry-aware subset selection and certification methodology. Anchors are known positions $\mathcal R$06, collected in

$\mathcal R$07

and the squared-range measurements obey

$\mathcal R$08

The true feasible set is the intersection of annuli,

$\mathcal R$09

while the upper-ball set is

$\mathcal R$10

Using pairwise differences of squared-range equations, the paper defines a polyhedral certificate $\mathcal R$11 and the certified localization set

$\mathcal R$12

The geometry-only component of CFPA is governed by the centered scatter matrix

$\mathcal R$13

which is translation-invariant and positive definite iff the anchors do not lie in a proper affine subspace (Calafiore, 15 Mar 2026).

Two offline subset-selection scores are emphasized. For a selected subset $\mathcal R$14 of size $\mathcal R$15,

$\mathcal R$16

The directional-width and diameter surrogates of the polyhedral certificate are controlled by $\mathcal R$17: $\mathcal R$18 and

$\mathcal R$19

Volume surrogates are controlled by $\mathcal R$20; discarding the $\mathcal R$21-dependent term yields

$\mathcal R$22

Accordingly, maximizing $\mathcal R$23 is recommended when worst-direction or diameter tightening is the goal, while maximizing $\mathcal R$24 is recommended when area or volume reduction is the goal.

The “contextual” element is supplied by a region $\mathcal R$25 encoding prior knowledge or operational constraints. Given a reference point $\mathcal R$26, CFPA selects anchors that are far relative to $\mathcal R$27 while also optimizing $\mathcal R$28 or $\mathcal R$29, with spread enforced through distance and angular-separation constraints. The exposition gives a greedy heuristic: rank anchors by distance to $\mathcal R$30, keep the top $\mathcal R$31 candidates, and iteratively add the anchor with maximal incremental gain in the selected score while maintaining minimum angular separation. No submodularity or approximation guarantees are stated.

A central limitation of pure farthest-only selection is stated directly: it may produce collinear or badly conditioned configurations, causing rank-deficient $\mathcal R$32 and loose or infinite $\mathcal R$33-based bounds. The paper counters this with $\mathcal R$34-aware online certificates. For any simplex weight $\mathcal R$35, it defines an enclosing ball of $\mathcal R$36 centered at $\mathcal R$37 with radius

$\mathcal R$38

yielding

$\mathcal R$39

It also gives the exact support function

$\mathcal R$40

and consequently the hybrid directional bound

$\mathcal R$41

with $\mathcal R$42. These $\mathcal R$43-aware terms remain finite whenever $\mathcal R$44, even when the polyhedral certificate deteriorates.

The reported two-dimensional experiments use $\mathcal R$45 candidate anchors sampled uniformly in an annulus of radii 1 and 2 around the target, with $\mathcal R$46 selected anchors and squared-range intervals of width $\mathcal R$47. Over 60 trials, the exact area of the coordinate-aligned bounding box of $\mathcal R$48 is $\mathcal R$49 for the oracle subset, $\mathcal R$50 for the D-score subset, $\mathcal R$51 for the E-score subset, and $\mathcal R$52 on average over subsets. The D-score slightly dominates the E-score for the area-oriented metric, and both are close to the oracle. For online certification, the hybrid coordinate-box bound has log-log correlation $\mathcal R$53 with the exact box area across 4200 subsets, with mean ratio bound/area approximately $\mathcal R$54 and median $\mathcal R$55. The remaining limitations are also explicit: anchor-position uncertainty is not handled, weighted scores are offline only when width envelopes are known a priori, and open problems include dynamic localization with bounded-error kinematics, decentralized evaluation of E/D scores, and robust CFPA under anchor uncertainties.

In aggregate, the literature shows CFPA as a domain-adapted anchoring principle rather than a single fixed algorithm. In Video LLMs it preserves exact skeleton tokens under saliency, context-consistency, and coverage constraints; in obstacle-aware geometry it supports exact farthest-anchor queries; in graph geodesics it becomes FPS-based anchor routing with stretch analysis; and in localization it combines farthest dispersion with geometry-aware selection and hybrid uncertainty certificates.