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

Oleg Ilushin

dblp:38/4059 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2005
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorTheory of computation · 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.

Theoretical computer science
1 paper
Computational geometry · 100%
Computer graphics and multimedia
1 paper
Geometric modeling and processing · 77% Computational fabrication · 23%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing
collision detection
0.112005
Precise global collision detection in multi-axis NC-machining · Comput. Aided Des. 2005
Computational geometry › geometric intersection
collision detection
0.012004
Continuous path verification in multi-axis NC-machining · SCG 2004
Computational geometry › arrangement
lower envelopes
0.012004
Continuous path verification in multi-axis NC-machining · SCG 2004
Computational fabrication › machining
CNC machining
0.012005
Precise global collision detection in multi-axis NC-machining · Comput. Aided Des. 2005

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

silhouette computation · 0.0radial projection · 0.0
YearPublicationVenuePosition
2005 Precise global collision detection in multi-axis NC-machining
Oleg Ilushin, Gershon Elber, Dan Halperin, Ron Wein, Myung-Soo Kim
Comput. Aided Des.1
2004 Continuous path verification in multi-axis NC-machining
abstract
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter continuously moves near the workpiece. Having five degrees of motion freedom, this problem is hard to solve exactly and we approximate the motion of the tool by a sequence of sub-paths of pure translations interleaved with pure rotations. The detection problem along each sub-path is then solved by using radial projection of the obstacles (the workpiece and other parts of the NC-machine) around the tool axis to obtain a collection of critical surface patches in ℝ3, and by examining planar silhouettes of these surface patches. We thus reduce the problem to successive computations of the lower envelope of a set of planar curves --- this reduction is exact, and incurs no loss of accuracy. We have implemented our algorithm in the IRIT environment for solid modeling, using an extension package of the CGAL library for computing envelopes. The algorithm, combined with the proper data structures, solves the collision detection problem in a robust manner, yet it yields efficient computation times as our experiments show. Our approach produces exact results in case of purely translational motion, and provides guaranteed (and good) approximation bounds in case the motion includes rotation.
Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperin
SCG2