Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from SIGIR 2026 / reviewers in the wild / expert

Eyal Flato

dblp:67/2276 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2002
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%
Artificial intelligence
1 paper
Motion planning and robot control · 100%
Theoretical computer science
1 paper
Computational geometry · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › computational geometry
minkowski sum		 0.012002
Exact minkowski sums and applications · SCG 2002
Robotics › Motion planning and robot control
motion planning		 0.012002
Exact minkowski sums and applications · SCG 2002
Computational geometry › geometric modeling and processing
minkowski sum		 0.012002
Exact minkowski sums and applications · SCG 2002

Methods — techniques the papers use, named apart from their topics

exact geometric computation · 0.1
YearPublicationVenuePosition
2002 Exact minkowski sums and applications
abstract
(MATH) The Minkowski sum of two sets P and Q in $\realsd is the set (p+q \mid p Ε P, q Ε Q). Minkowski sums are useful in robot motion planning, computer-aided design and manufacturing (CAD/CAM) and many other areas. In this video we present a software package implemented at Tel Aviv University for the exact and efficient construction of Minkowski sums of planar sets. We also explain and demonstrate how Minkowski sums are used in various applications.
Eyal Flato, Efi Fogel, Dan Halperin, Eran Leiserowitz
 SCG1
2002 Polygon decomposition for efficient construction of Minkowski sums
Pankaj K. Agarwal, Eyal Flato, Dan Halperin
 Comput. Geom.2
2000 Polygon Decomposition for Efficient Construction of Minkowski Sums
Pankaj K. Agarwal, Eyal Flato, Dan Halperin
 ESA2