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

Nima Fathollahi

dblp:362/9534 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2023
0009-0005-5220-6187ORCID · reported

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

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author · 1 since 2021

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%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › mesh processing
mesh simplification
0.712023
Lock-free Vertex Clustering for Multicore Mesh Reduction · SIGGRAPH Asia 2023
Geometric modeling and processing › mesh processing › mesh simplification
vertex clustering
0.712023
Lock-free Vertex Clustering for Multicore Mesh Reduction · SIGGRAPH Asia 2023
Parallel and multicore computing › parallel algorithms › parallel geometric algorithms
parallel mesh processing
0.712023
Lock-free Vertex Clustering for Multicore Mesh Reduction · SIGGRAPH Asia 2023

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

multicore parallelization · 1.3lock-free algorithms · 1.3
YearPublicationVenuePosition
2023 Lock-free Vertex Clustering for Multicore Mesh Reduction
abstract
Modern data collection methods can capture representations of 3D objects at resolutions much greater than they can be discretely rendered as an image. To improve the efficiency of storage, transmission, rendering, and editing of 3D models constructed from such data, it is beneficial to first employ a mesh reduction technique to reduce the size of a mesh. Vertex clustering, a technique that merges close vertices together, has particularly wide applicability, because it operates only on vertices and their spatial proximity. However, it is also very difficult to accelerate with parallelisation in a deterministic manner because it contains extensive algorithmic dependencies.
Nima Fathollahi, Sean Chester
SIGGRAPH Asia1