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

R. Kakio

dblp:51/3951 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2000
—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.

Computer graphics and multimedia
1 paper
Geometric modeling and processing · 50% Rendering · 50%

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

TopicWeightPapersLastEvidence papers
Rendering
hidden surface removal
0.012000
Fast Visualization of NC Milling Result Using Graphics Acceleration Hardware · ICRA 2000
Geometric modeling and processing
solid modeling
0.012000
Fast Visualization of NC Milling Result Using Graphics Acceleration Hardware · ICRA 2000

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

tessellation · 0.0swept volume computation · 0.0
YearPublicationVenuePosition
2000 Fast Visualization of NC Milling Result Using Graphics Acceleration Hardware
abstract
In order to detect potential problems of a cutter path, geometric verification of the NC milling result is necessary prior to actual machining. Result shape of the workpiece can be computed by subtracting the swept volume of a cutter moving along the path from a solid model representing the stock shape. In this paper, the authors propose an acceleration method of the subtracting operation using the hidden surface elimination mechanism of the 3 dimensional graphics hardware. Before the operation, component surfaces of the cutter swept volume must be tessellated. Computation time of the proposed method is proportional to the total number of polygons approximating the component surfaces. Some portions of the surfaces do not contribute the result shape of the workpiece. Our algorithm reduces the polygons by properly excluding such surface portions from the tessellation. An experimental program is implemented and computations of some sculptured surface milling results are demonstrated.
M. Inui, R. Kakio
ICRA2