Kōkichi Sugihara
About
In The Last Decade
Kōkichi Sugihara
144 papers receiving 5.5k citations
Hit Papers
Peers
Comparison fields: 5 of 186
- Computer Graphics and Computer-Aided Design 1.5k
- Computer Vision and Pattern Recognition 1.3k
- Computational Mechanics 816
- Signal Processing 638
- Computer Networks and Communications 625
Countries citing papers authored by Kōkichi Sugihara
This map shows the geographic impact of Kōkichi Sugihara'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 Kōkichi Sugihara with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kōkichi Sugihara more than expected).
Fields of papers citing papers by Kōkichi Sugihara
This network shows the impact of papers produced by Kōkichi Sugihara. 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 Kōkichi Sugihara. The network helps show where Kōkichi Sugihara may publish in the future.
Co-authorship network of co-authors of Kōkichi Sugihara
This figure shows the co-authorship network connecting the top 25 collaborators of Kōkichi Sugihara. A scholar is included among the top collaborators of Kōkichi Sugihara 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 Kōkichi Sugihara. Kōkichi Sugihara is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 14 | |
| 2 | 2 | |
| 3 | 53 | |
| 4 | 1 | |
| 5 | 2 | |
| 6 | Plane-Sweep Algorithm of O(nlogn) for the Inclusion Hierarchy among Circles | 1 |
| 7 | Topology-Oriented Construction of Line Arrangements | 1 |
| 8 | Unifying Method for Computing the Circumcircles of Three Circles | 1 |
| 9 | 81 | |
| 10 | 57 | |
| 11 | How to Make Geometric Algorithms Robust | 5 |
| 12 | Another Proof of Polynomial-Time Recognizability of Delaunay Graphs | 3 |
| 13 | Genetic Algorithms for Adaptive Planning of Path and Trajectory of a Mobile Robot in 2D Terrains | 22 |
| 14 | Numerically Robust Algorithm for Contructing Constrained Delaunay Triangulation. | 3 |
| 15 | 20 | |
| 16 | A Simple Method for Avoiding Numerical Errors and Degeneracy in Voronoi Diagram Construction | 19 |
| 17 | A solid modelling system free from topological inconsistency | 66 |
| 18 | Location of robot using sparse visual information | 6 |
| 19 | 12 | |
| 20 | Range data understanding guided by a junction dictionary | 5 |
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.