| Download | - View accepted manuscript: Mesh Simplification in Parallel (PDF, 616 KiB)
|
|---|
| Author | Search for: Langis, C.; Search for: Roth, Gerhard; Search for: Dehne, F. |
|---|
| Format | Text, Article |
|---|
| Conference | Proceedings of the 4th International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP 2000),, December 11-13, 2000. |
|---|
| Abstract | This paper presents a parallel method for progressive mesh simplification. A progressive mesh (PM) is a continuous mesh representation of a given 3D object which makes it possible to efficiently access all mesh representations between a low and a high level of resolution. The creation of a progressive mesh is a time consuming process and has a need for parallelization. Our parallel approach considers the original mesh as a graph and performs first a greedy graph partitioning. Then, each partition is sent to a processor of a coarse-grained parallel system. The individual mesh partitions are converted in parallel to the PM format using a serial algorithm on each processor. The results are then merged together to produce a single large PM file. This merging process also solves the border problem within the partition in a simple and efficient way. Our approach enables us to achieve close to optimal speedup. We demonstrate the results experimentally on a number of data sets. |
|---|
| Publication date | 2000 |
|---|
| Language | English |
|---|
| NRC number | NRCC 44161 |
|---|
| NPARC number | 8913301 |
|---|
| Export citation | Export as RIS |
|---|
| Report a correction | Report a correction (opens in a new tab) |
|---|
| Record identifier | f4903357-be1e-4eb1-9527-1ba1531a9545 |
|---|
| Record created | 2009-04-22 |
|---|
| Record modified | 2020-03-26 |
|---|
