Hichem Barki

Université Claude Bernard Lyon 1

Papers

2

Total Citations

51

H-Index

2

About

Hichem Barki is a leading researcher in computational geometry, with a primary focus on the efficient and exact computation of Minkowski sums for polyhedra—a fundamental operation with critical applications in computer-aided design, robotics, and image analysis. His major contributions center on the development of the Contributing Vertices-based Minkowski Sum (CVMS) framework. In his highly cited 2009 work (39 citations), Barki established a robust method for convex polyhedra. He then advanced the field significantly with his 2011 paper (12 citations), which extended this exact computation to the far more challenging case of nonconvex–convex polyhedral pairs. This work directly addressed a long-standing difficulty in the field, providing a practical and theoretically sound solution for complex geometric modeling. Barki’s research is notable for its focus on algorithmic correctness and computational feasibility, bridging a critical gap between theoretical geometry and real-world engineering applications. His CVMS algorithms remain a cornerstone reference for researchers and engineers working on collision detection, path planning, and solid modeling.

Research Focus

Key Achievements

2
H-Index
2
Papers
51
Total Citations
26
Avg Citations/Paper
🏆 Most Cited Paper
Contributing vertices-based Minkowski sum computation of convex polyhedra
39 citations · 2009
📈 Most Prolific Year: 2009 (1 Papers)
🤝 Key Collaborators: 2
🏛 Institutions: Université Claude Bernard Lyon 1

Top Papers

  1. 1
  2. 2

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 13 days ago