Efficient computation of constrained parameterizations on parallel platforms
Constrained isometric planar parameterizations are central to a broad spectrum of applications. In this work, we present a non linear solver developed on OpenCL that is efficiently parallelizable on modern massively parallel architectures. We establish how parameterization relates to mesh smoothing...
Saved in:
Published in | Computers & graphics Vol. 37; no. 6; pp. 596 - 607 |
---|---|
Main Authors | , , |
Format | Journal Article Conference Proceeding |
Language | English |
Published |
Oxford
Elsevier Ltd
01.10.2013
Elsevier |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Constrained isometric planar parameterizations are central to a broad spectrum of applications. In this work, we present a non linear solver developed on OpenCL that is efficiently parallelizable on modern massively parallel architectures. We establish how parameterization relates to mesh smoothing and show how to efficiently and robustly solve the planar mesh parameterization problem with constraints. Furthermore, we demonstrate the applicability of our approach to real-time cut-and-paste editing and interactive mesh deformation.
[Display omitted]
•Establishes the relation between mesh smoothing and parameterization techniques.•Derives a simplified formulation for the isometric parameterization problem.•Presents an efficient parallel implementation of a non-linear solver.•Presents an iterative topological untangling process for constrained parameterization.•Demonstrates the applicability of our approach on feature cut-and-paste design. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 ObjectType-Article-1 ObjectType-Feature-2 |
ISSN: | 0097-8493 1873-7684 |
DOI: | 10.1016/j.cag.2013.05.023 |