Eyal Flato

According to our database, Eyal Flato authored at least 5 papers between 1999 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2002

Polygon decomposition for efficient construction of Minkowski sums.

Pankaj K. Agarwal, Eyal Flato, Dan Halperin

Comput. Geom., 2002

Exact minkowski sums and applications.

Eyal Flato, Efi Fogel, Dan Halperin, Eran Leiserowitz

Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

2000

The Design and Implementation of Planar Maps in CGAL.

Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan, Eti Ezra

ACM J. Exp. Algorithmics, 2000

Robust and Efficient Construction of Planar Minkowski Sums.

Eyal Flato, Dan Halperin

EuroCG, 2000

1999

The Design and Implementation of Planar Maps in CGAL.

Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan

Proceedings of the Algorithm Engineering, 1999