Makoto Ohsaki

Orcid: 0000-0003-4935-8874

According to our database1, Makoto Ohsaki authored at least 19 papers between 2000 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Hierarchical graph-based machine learning model for optimization of three-dimensional braced steel frame.
Eng. Appl. Artif. Intell., 2025

2024
Multi-objective optimization of truss structure using multi-agent reinforcement learning and graph representation.
Eng. Appl. Artif. Intell., 2024

Topology optimization of periodic lattice structures for specified mechanical properties using machine learning considering member connectivity.
CoRR, 2024

2023
Deep deterministic policy gradient and graph attention network for geometry optimization of latticed shells.
Appl. Intell., September, 2023

Mean curvature flow for generating discrete surfaces with piecewise constant mean curvatures.
Comput. Aided Geom. Des., April, 2023

Real and complexified configuration spaces for spherical 4-bar linkages.
CoRR, 2023

2022
Graph-based reinforcement learning for discrete cross-section optimization of planar steel frames.
Adv. Eng. Informatics, 2022

2021
Geometry and topology optimization of plane frames for compliance minimization using force density method for geometry model.
Eng. Comput., 2021

Reinforcement learning for optimum design of a plane frame under static loads.
Eng. Comput., 2021

Discrete Gaussian Curvature Flow for Piecewise Constant Gaussian Curvature Surface.
Comput. Aided Des., 2021

Machine-specified ground structures for topology optimization of binary trusses using graph embedding policy network.
Adv. Eng. Softw., 2021

2019
FDMopt: Force density method for optimal geometry and topology of trusses.
Adv. Eng. Softw., 2019

2017
Hyperspectral imaging using flickerless active LED illumination.
Proceedings of the Thirteenth International Conference on Quality Control by Artificial Vision, 2017

2008
Enumerating Constrained Non-crossing Minimally Rigid Frameworks.
Discret. Comput. Geom., 2008

2007
Triangulating a convex polygon with fewer number of non-standard bars.
Theor. Comput. Sci., 2007

2006
Contact Analysis of Cable Networks by Using Second-Order Cone Programming.
SIAM J. Sci. Comput., 2006

Enumerating Non-crossing Minimally Rigid Frameworks.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005
Triangulating a Convex Polygon with Small Number of Non-standard Bars.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2000
Approximating Uniform Triangular Meshes in Polygons.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000


  Loading...