This map shows the geographic impact of H. Späth's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by H. Späth with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites H. Späth more than expected).
This network shows the impact of papers produced by H. Späth. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by H. Späth. The network helps show where H. Späth may publish in the future.
Co-authorship network of co-authors of H. Späth
This figure shows the co-authorship network connecting the top 25 collaborators of H. Späth.
A scholar is included among the top collaborators of H. Späth based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with H. Späth. H. Späth is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Späth, H.. (2006). Data fitting with a set of two concentric spheres. Mathematical communications. 11(1). 63–68.3 indexed citations
3.
Späth, H.. (2004). Fitting affine and orthogonal transformations between two sets of points. Mathematical communications. 9(1). 27–34.16 indexed citations
Späth, H.. (2001). Least squares fitting of spheres and ellipsoids using not orthogonal distances. Mathematical communications. 6(1). 89–96.5 indexed citations
6.
Späth, H.. (2001). Least squares fitting with rotated paraboloids. Mathematical communications. 6(2). 173–179.9 indexed citations
7.
Späth, H. & G. A. Watson. (2001). On a sequential linear programming approach to finding the smallest circumscribed, largest inscribed, and minimum zone circle or sphere. Mathematical communications. 6(1). 29–38.4 indexed citations
8.
Späth, H.. (2001). Minisum location in space with restriction to curves and surfaces. Mathematical communications. 6(1). 47–55.1 indexed citations
9.
Späth, H., et al.. (1999). Least squares fitting of conic sections with type identification by NURBS of degree two. Mathematical communications. 4(2). 207–218.2 indexed citations
Späth, H.. (1998). Least-squares fitting of parametric curves with a linear function of several variables as argument. Mathematical communications. 3(1). 61–66.1 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.