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 VLDB 2026 / reviewers in the wild / expert

Naama Mayer

dblp:90/8414 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorArtificial intelligence and machine learning · 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%
Databases, data mining, and information retrieval
1 paper
Data integration and cleaning · 100%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › computational geometry › polyhedral geometry
convex polyhedra		 0.112011
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space · Comput. Aided Des. 2011
Geometric modeling and processing › computational geometry
minkowski sum computation		 0.112011
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space · Comput. Aided Des. 2011
YearPublicationVenuePosition
2011 Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
Naama Mayer, Efi Fogel, Dan Halperin
 Comput. Aided Des.1
2011 Identifying Join Candidates in the Cairo Genizah
Lior Wolf, Rotem Littman, Naama Mayer, Tanya German, Nachum Dershowitz, Roni Shweka, Yaacov Choueka
 Int. J. Comput. Vis.3
2010 Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
abstract
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3, where one of the polytopes frequently rotates. The algorithm is based on pre-computing a so-called criticality map, which records the changes in the underlying graph-structure of the Minkowski sum, while one of the polytopes rotates. We give tight combinatorial bounds on the complexity of the criticality map when the rotating polytope rotates about one, two, or three axes. The criticality map can be rather large already for rotations about one axis, even for summand polytopes with a moderate number of vertices each. We therefore focus on the restricted case of rotations about a single, though arbitrary, axis.
Naama Mayer, Efi Fogel, Dan Halperin
 Symposium on Solid and Physical Modeling1