Efi Fogel

Orcid: 0000-0001-7228-8806

According to our database1, Efi Fogel authored at least 25 papers between 2001 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Area Optimal Polygonization Using Simulated Annealing.
ACM J. Exp. Algorithmics, 2022

CGAL Made More Accessible.
CoRR, 2022

2021
Optimized Synthesis of Snapping Fixtures.
Proceedings of the Algorithmic Foundations of Robotics XIV, 2021

2018
Exact Minkowski sums of polygons with holes.
Comput. Geom., 2018

2013
Polyhedral Assembly Partitioning With Infinite Translations or The Importance of Being Exact.
IEEE Trans Autom. Sci. Eng., 2013

The computational geometry algorithms library CGAL.
ACM Commun. Comput. Algebra, 2013

2012
Lines through Segments in 3D Space.
Proceedings of the Algorithms - ESA 2012, 2012

CGAL Arrangements and Their Applications - A Step-by-Step Guide.
Geometry and Computing 7, Springer, ISBN: 978-3-642-17282-3, 2012

2011
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space.
Comput. Aided Des., 2011

2010
Arrangements on Parametric Surfaces I: General Framework and Infrastructure.
Math. Comput. Sci., 2010

Arrangements on Parametric Surfaces II: Concretizations and Applications.
Math. Comput. Sci., 2010

2009
On the Exact Maximum Complexity of Minkowski Sums of Polytopes.
Discret. Comput. Geom., 2009

Minkowski Sum Construction and other Applications of Arrangements of Geodesic Arcs on the Sphere
CoRR, 2009

2008
Minkowski sum construction and other applications of arrangements of geodesic arcs on the sphere
PhD thesis, 2008

Polyhedral Assembly Partitioning with Infinite Translations or <i>The Importance of Being Exact</i>.
Proceedings of the Algorithmic Foundation of Robotics VIII, 2008

Computational geometry algorithms library.
Proceedings of the International Conference on Computer Graphics and Interactive Techniques, 2008

Arrangements of geodesic arcs on the sphere.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
Advanced programming techniques applied to Cgal's arrangement package.
Comput. Geom., 2007

Exact and efficient construction of Minkowski sums of convex polyhedra with applications.
Comput. Aided Des., 2007

Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step.
Proceedings of the Algorithms, 2007

On the exact maximum complexity of Minkowski sums of convex polyhedra.
Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2005
Exact Minkowski sums of convex polyhedra.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2004
Code Flexibility and Program Efficiency by Genericity: Improving Cgal's Arrangements.
Proceedings of the Algorithms, 2004

2002
Exact minkowski sums and applications.
Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

2001
A web architecture for progressive delivery of 3D content.
Proceedings of the Sixth International Conference on 3D Web Technology, 2001


  Loading...