Efi Fogel

Tel Aviv University

Papers

3

Total Citations

30

H-Index

2

About

Efi Fogel is a leading figure in computational geometry and geometric computing, with a career dedicated to bridging robust theoretical algorithms with practical software implementation. His primary research areas include exact geometric computation, arrangement theory, and the algorithmic design of Minkowski sums. Fogel is best known for his foundational work on the CGAL (Computational Geometry Algorithms Library) Arrangements package, which he co-developed and documented in the highly cited book *CGAL Arrangements and Their Applications: A Step-by-Step Guide* (2012, 25 citations). This resource has become an essential reference for researchers and engineers working on problems in robotics, CAD/CAM, and geographic information systems. His early work on exact Minkowski sums (2002, 3 citations) provided critical algorithms for motion planning and shape synthesis, enabling precise collision detection and fixture design. More recently, Fogel has applied these geometric tools to manufacturing, contributing to the optimized synthesis of snapping fixtures (2021, 2 citations). Through his sustained contributions to CGAL, Fogel has empowered countless practitioners to implement robust, error-free geometric computations in real-world applications, cementing his legacy as a key architect of modern computational geometry infrastructure.

Research Focus

Key Achievements

2
H-Index
3
Papers
30
Total Citations
10
Avg Citations/Paper
🏆 Most Cited Paper
CGAL Arrangements and Their Applications: A Step-by-Step Guide
25 citations · 2012
📈 Most Prolific Year: 2012 (1 Papers)
🤝 Key Collaborators: 5
🏛 Institutions: Tel Aviv University

Top Papers

  1. 1
  2. 2
  3. 3

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 12 days ago