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

Wenshan Fan

dblp:71/9986 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2013
—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-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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 · 75% Computer animation and physical simulation · 25%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing
collision detection
0.212013
An octree-based proxy for collision detection in large-scale particle systems · Sci. China Inf. Sci. 2013
Geometric modeling and processing › spatial data structures
octree
0.212013
An octree-based proxy for collision detection in large-scale particle systems · Sci. China Inf. Sci. 2013
Computer animation and physical simulation › particle-based simulation
particle systems
0.212013
An octree-based proxy for collision detection in large-scale particle systems · Sci. China Inf. Sci. 2013
Geometric modeling and processing
spatial data structures
0.212013
An octree-based proxy for collision detection in large-scale particle systems · Sci. China Inf. Sci. 2013

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

octree · 0.2
YearPublicationVenuePosition
2013 An octree-based proxy for collision detection in large-scale particle systems
Wenshan Fan, Bin Wang 0021, Jean-Claude Paul, Jia-Guang Sun 0001
Sci. China Inf. Sci.1
2011 Parallel Spatial Hashing for Collision Detection of Deformable Surfaces
abstract
We present a fast collision detection method for deformable surfaces with parallel spatial hashing on GPU architecture. The efficient update and access of the uniform grid are exploited to accelerate the performance in our method. To deal with the inflexible memory system, which makes the building of stream data a challenging task on GPU, we propose to subdivide the whole workload into irregular segments and design an efficient evaluation algorithm, which employs parallel scan and stream compaction, to build the stream data in parallel. The load balancing is a key aspect that needs to be considered in the SIMD parallelism. We break the heavy and irregular collision computation down into lightweight part and heavyweight part, ensuring the later perfectly run in load balancing manner with each concurrent thread processes just a single collision. In practice, our approach can perform collision detection in tens of milliseconds on a PC with NVIDIAGTX 260 graphics card on benchmarks composed of millions of triangles. The results highlight our speedups over prior CPU-based and GPU-based algorithms.
Wenshan Fan, Bin Wang 0021, Jianliang Zhou, Jia-Guang Sun 0001
CAD/Graphics1
2011 A Hierarchical Grid Based Framework for Fast Collision Detection
abstract
Abstract We present a novel hierarchical grid based method for fast collision detection (CD) for deformable models on GPU architecture. A two‐level grid is employed to accommodate the non‐uniform distribution of practical scene geometry. A bottom‐to‐top method is implemented to assign the triangles into the hierarchical grid without any iteration while a deferred scheme is introduced to efficiently update the data structure. To address the issue of load balancing, which greatly influences the performance in SIMD parallelism, a propagation scheme which utilizes a parallel scan and a segmented scan is presented, distributing workloads evenly across all concurrent threads. The proposed method supports both discrete collision detection (DCD) and continuous collision detection (CCD) with self‐collision. Some typical benchmarks are tested to verify the effectiveness of our method. The results highlight our speedups over prior algorithms on different commodity GPUs.
Wenshan Fan, Bin Wang 0021, Jean-Claude Paul, Jia-Guang Sun 0001
Comput. Graph. Forum1