Manifold Differential Evolution (MDE) : A global optimization method for geodesic Centroidal Voronoi Tessellations on meshes
Computing centroidal Voronoi tessellations (CVT) has many applications in computer graphics. The existing methods, such as the Lloyd algorithm and the quasi-Newton solver, are efficient and easy to implement; however, they compute only the local optimal solutions due to the highly non-linear nature...
Saved in:
Main Authors: | , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/89444 http://hdl.handle.net/10220/46265 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-89444 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-894442020-03-07T11:49:00Z Manifold Differential Evolution (MDE) : A global optimization method for geodesic Centroidal Voronoi Tessellations on meshes Liu, Yong-Jin Xu, Chun-Xu Yi, Ran Fan, Dian He, Ying School of Computer Science and Engineering Centroidal Voronoi Tessellation Geodesic Voronoi Diagram DRNTU::Engineering::Computer science and engineering Computing centroidal Voronoi tessellations (CVT) has many applications in computer graphics. The existing methods, such as the Lloyd algorithm and the quasi-Newton solver, are efficient and easy to implement; however, they compute only the local optimal solutions due to the highly non-linear nature of the CVT energy. This paper presents a novel method, called manifold differential evolution (MDE), for computing globally optimal geodesic CVT energy on triangle meshes. Formulating the mutation operator using discrete geodesics, MDE naturally extends the powerful differential evolution framework from Euclidean spaces to manifold domains. Under mild assumptions, we show that MDE has a provable probabilistic convergence to the global optimum. Experiments on a wide range of 3D models show that MDE consistently outperforms the existing methods by producing results with lower energy. Thanks to its intrinsic and global nature, MDE is insensitive to initialization and mesh tessellation. Moreover, it is able to handle multiply-connected Voronoi cells, which are challenging to the existing geodesic CVT methods. MOE (Min. of Education, S’pore) Accepted version 2018-10-09T07:33:03Z 2019-12-06T17:25:37Z 2018-10-09T07:33:03Z 2019-12-06T17:25:37Z 2016 Journal Article Liu, Y. J., Xu, C. X., Yi, R., Fan, D., & He, Y. (2016). Manifold differential evolution (MDE). ACM Transactions on Graphics, 35(6), 1-10. doi:10.1145/2980179.2982424 0730-0301 https://hdl.handle.net/10356/89444 http://hdl.handle.net/10220/46265 10.1145/2980179.2982424 en ACM Transactions on Graphics © 2016 Association for Computing Machinery (ACM). This is the author created version of a work that has been peer reviewed and accepted for publication by ACM Transactions on Graphics, Association for Computing Machinery (ACM). It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [http://dx.doi.org/10.1145/2980179.2982424]. 10 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
topic |
Centroidal Voronoi Tessellation Geodesic Voronoi Diagram DRNTU::Engineering::Computer science and engineering |
spellingShingle |
Centroidal Voronoi Tessellation Geodesic Voronoi Diagram DRNTU::Engineering::Computer science and engineering Liu, Yong-Jin Xu, Chun-Xu Yi, Ran Fan, Dian He, Ying Manifold Differential Evolution (MDE) : A global optimization method for geodesic Centroidal Voronoi Tessellations on meshes |
description |
Computing centroidal Voronoi tessellations (CVT) has many applications in computer graphics. The existing methods, such as the Lloyd algorithm and the quasi-Newton solver, are efficient and
easy to implement; however, they compute only the local optimal solutions due to the highly non-linear nature of the CVT energy. This paper presents a novel method, called manifold differential
evolution (MDE), for computing globally optimal geodesic CVT energy on triangle meshes. Formulating the mutation operator using discrete geodesics, MDE naturally extends the powerful differential evolution framework from Euclidean spaces to manifold domains. Under mild assumptions, we show that MDE has a provable probabilistic convergence to the global optimum. Experiments on a wide range of 3D models show that MDE consistently outperforms the existing methods by producing results with lower energy. Thanks to its intrinsic and global nature, MDE is insensitive to initialization and mesh tessellation. Moreover, it is able to handle multiply-connected Voronoi cells, which are challenging to the existing geodesic CVT methods. |
author2 |
School of Computer Science and Engineering |
author_facet |
School of Computer Science and Engineering Liu, Yong-Jin Xu, Chun-Xu Yi, Ran Fan, Dian He, Ying |
format |
Article |
author |
Liu, Yong-Jin Xu, Chun-Xu Yi, Ran Fan, Dian He, Ying |
author_sort |
Liu, Yong-Jin |
title |
Manifold Differential Evolution (MDE) : A global optimization method for geodesic Centroidal Voronoi Tessellations on meshes |
title_short |
Manifold Differential Evolution (MDE) : A global optimization method for geodesic Centroidal Voronoi Tessellations on meshes |
title_full |
Manifold Differential Evolution (MDE) : A global optimization method for geodesic Centroidal Voronoi Tessellations on meshes |
title_fullStr |
Manifold Differential Evolution (MDE) : A global optimization method for geodesic Centroidal Voronoi Tessellations on meshes |
title_full_unstemmed |
Manifold Differential Evolution (MDE) : A global optimization method for geodesic Centroidal Voronoi Tessellations on meshes |
title_sort |
manifold differential evolution (mde) : a global optimization method for geodesic centroidal voronoi tessellations on meshes |
publishDate |
2018 |
url |
https://hdl.handle.net/10356/89444 http://hdl.handle.net/10220/46265 |
_version_ |
1681037798214205440 |