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

Uzi Sarel

dblp:85/5972 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · none

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

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 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.

Artificial intelligence
1 paper
Motion planning and robot control · 100%
Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control
collision detection
0.112006
Efficient Continuous Collision Detection for Bounding Boxes under Rational Motion · ICRA 2006
Robotics › Motion planning and robot control › collision detection
continuous collision detection
0.112006
Efficient Continuous Collision Detection for Bounding Boxes under Rational Motion · ICRA 2006

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

spherical gauss map · 0.1rational equation solving · 0.1minkowski sum · 0.1
YearPublicationVenuePosition
2006 Efficient Continuous Collision Detection for Bounding Boxes under Rational Motion
abstract
This paper presents a simple yet precise and efficient algorithm for collision prediction of two oriented bounding boxes under univariate (piecewise) rational motion. We present an analytic solution to the problem of finding the time of collision and the feature involved, or declaring that no collision should occur. Our solution can be applied to boxes of any size, under arbitrary rational rigid motion. The algorithm is based on the efficient examination of the Minkowski sum (MS) of the two boxes, using a spherical Gauss map dual representation, and a precise extraction of the collision time, if any, as a solution to a set of rational equations that are automatically derived
Dan Albocher, Uzi Sarel, Yi-King Choi, Gershon Elber
ICRA2