VLDB 2026 Research / reviewers in the wild / expert
H. Blum
dblp:47/516
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1977
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 56% Computational geometry · 44% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational geometry
geometric transformation |
0.0 | 1 | 1977 | A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space · IEEE Trans. Computers 1977 |
Graph algorithms and graph theory
graph algorithms |
0.0 | 1 | 1977 | A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space · IEEE Trans. Computers 1977 |
Graph algorithms and graph theory › spanning tree
minimum spanning tree |
0.0 | 1 | 1977 | A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space · IEEE Trans. Computers 1977 |
Computational geometry › graph drawing › geometric embedding
distance preservation |
0.0 | 1 | 1977 | A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space · IEEE Trans. Computers 1977 |
Computational geometry › graph drawing › geometric embedding
distance-preserving embedding |
0.0 | 1 | 1977 | A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space · IEEE Trans. Computers 1977 |
Methods — techniques the papers use, named apart from their topics
triangulation · 0.0minimal spanning tree · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1977 | A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-SpaceabstractA method for the sequential mapping of points in a high-dimensional space onto a plane is presented. Whenever a new point is mapped, its distgnces to two points previously mapped are exactly preserved. On the resulting map, 2M -3 of the original distances can be exactly preserved. The mapping is based on the distances of a minimal spanning tree constructed from the points. All of the distances on the minimal spanning tree are exactly preserved. Richard C. T. Lee, James R. Slagle, H. Blum |
IEEE Trans. Computers | 3 |