MAP

Atlas-Inspired

Precomputed

Semantic Map Explorer

Project clustered samples into a 2D field, inspect exact neighbors, and compare how graph-style and centroid-style retrieval diverge from the ground truth.

DATASETS

Sample Packs

Start with a curated text corpus or jump straight into a synthetic vector field.

SETUP

Projection Controls

Text packs embed locally in the browser. Geometry Lab reuses precomputed vectors.

Model

Top K6

HNSW M6

HNSW efSearch18

HNSW efConstruction64

IVF nlist8

IVF nprobe2

Source

Synthetic · generated in-app

Original synthetic data: 800 points in four seeded uniform disks; mulberry32 seed 42. Coordinates are the actual two-dimensional vectors. Generator is MIT-licensed with this repository.

Building semantic map...

EXACT

Ground Truth

Brute-force top-6 nearest neighbors using euclidean distance.

HNSW

Graph Search

Seeded hierarchical insertion with neighbor pruning. — layers; base-layer degree capped at 12.

IVF

Centroid Search

Partition-first retrieval across 8 lists, probing 2 of them per query.

MAP

Atlas-Inspired

Precomputed

Semantic Map Explorer

Project clustered samples into a 2D field, inspect exact neighbors, and compare how graph-style and centroid-style retrieval diverge from the ground truth.

DATASETS

Sample Packs

Start with a curated text corpus or jump straight into a synthetic vector field.

SETUP

Projection Controls

Text packs embed locally in the browser. Geometry Lab reuses precomputed vectors.

Model

Top K6

HNSW M6

HNSW efSearch18

HNSW efConstruction64

IVF nlist8

IVF nprobe2

Source

Synthetic · generated in-app

Original synthetic data: 800 points in four seeded uniform disks; mulberry32 seed 42. Coordinates are the actual two-dimensional vectors. Generator is MIT-licensed with this repository.

Building semantic map...

EXACT

Ground Truth

Brute-force top-6 nearest neighbors using euclidean distance.

HNSW

Graph Search

Seeded hierarchical insertion with neighbor pruning. — layers; base-layer degree capped at 12.

IVF

Centroid Search

Partition-first retrieval across 8 lists, probing 2 of them per query.