Hiroshi Imai spends much of his time researching Combinatorics, Discrete mathematics, Algorithm, Mathematical optimization and Computational geometry. He combines subjects such as Weighted Voronoi diagram, Bell's theorem, Convex polytope and Polygon with his study of Combinatorics. His study in Fisher information extends to Discrete mathematics with its themes.
His Algorithm research integrates issues from Polygonal chain, Piecewise linear function, Sequence and K shortest path routing. In general Mathematical optimization study, his work on Search algorithm, Combinatorial optimization and Local search often relates to the realm of Nurse scheduling problem, thereby connecting several areas of interest. His study in Computational geometry is interdisciplinary in nature, drawing from both Voronoi diagram and Plane.
The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Algorithm, Voronoi diagram and Theoretical computer science. His Combinatorics research includes elements of Convex polytope and Regular polygon. His Discrete mathematics study incorporates themes from Quantum finite automata and Binary decision diagram.
Hiroshi Imai interconnects Sequence and Shortest path problem in the investigation of issues within Algorithm. His Voronoi diagram research is multidisciplinary, incorporating perspectives in Quantum state, Computational geometry and Divergence. His studies link Centroidal Voronoi tessellation with Power diagram.
Hiroshi Imai focuses on Discrete mathematics, Combinatorics, Voronoi diagram, Algorithm and Quantum state. His Discrete mathematics research is multidisciplinary, incorporating elements of Flow, Elliptic curve cryptography and Computational geometry. The Combinatorics study combines topics in areas such as Facet, Hamming weight and Regular polygon.
Hiroshi Imai has included themes like Geodesic, Motion planning and Pure mathematics in his Voronoi diagram study. His Algorithm research incorporates elements of Binary number, Graph and Scalar multiplication. His research integrates issues of Statistical physics and Qubit in his study of Quantum state.
Combinatorics, Voronoi diagram, Quantum algorithm, Discrete mathematics and Pure mathematics are his primary areas of study. His Combinatorics study integrates concerns from other disciplines, such as Regular polygon, Semidefinite programming and Quantum correlation. His biological study spans a wide range of topics, including Quantum state, Voltage graph and Qubit.
His research investigates the connection between Quantum algorithm and topics such as Quantum capacity that intersect with problems in Quantum error correction and Quantum channel. Hiroshi Imai specializes in Discrete mathematics, namely Geometric graph theory. His studies deal with areas such as Isotropy, Inequality and Observable as well as Pure mathematics.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering: (extended abstract)
Mary Inaba;Naoki Katoh;Hiroshi Imai.
symposium on computational geometry (1994)
VORONOI DIAGRAM IN THE LAGUERRE GEOMETRY AND ITS APPLICATIONS
Hiroshi Imai;Masao Iri;Kazuo Murota.
SIAM Journal on Computing (1985)
Polygonal Approximations of a Curve — Formulations and Algorithms
Hiroshi Imai;Masao Iri.
Machine Intelligence and Pattern Recognition (1988)
Computational-geometric methods for polygonal approximations of a curve
Hiroshi Imai;Masao Iri.
Graphical Models /graphical Models and Image Processing /computer Vision, Graphics, and Image Processing (1986)
Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
Hiroshi Imai;Takao Asano.
Journal of Algorithms (1983)
Biological sequence compression algorithms.
Toshiko Matsumoto;Kunihiko Sadakane;Hiroshi Imai.
Genome Informatics (2000)
Finding k points with minimum diameter and related problems
Alok Aggarwal;Hiroshi Imai;Naoki Katoh;Subhash Suri.
Journal of Algorithms (1991)
Visibility-polygon search and euclidean shortest paths
Takao Asano;Tetsuo Asano;Leonidas Guibas;John Hershberger.
foundations of computer science (1985)
A fibre bundle over manifolds of quantum channels and its application to quantum statistics
Akio Fujiwara;Hiroshi Imai.
Journal of Physics A (2008)
A fast algorithm for finding better routes by AI search techniques
T. Ikeda;Min-Yao Hsu;H. Imai;S. Nishimura.
vehicle navigation and information systems conference (1994)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: