微信服务号

微信订阅号

2025-5-11- 9
Home > Archive>Volume 30, Issue 12, 2019 >3862-3875. DOI:10.13328/j.cnki.jos.005586
PDF HTML XML Export Cite reminder
Efficient Mesh Merging Method with Reusable Laplacian Operator
Author:
Affiliation:

Clc Number:

TP391

Fund Project:

Zhejiang Provincial Natural Science Foundation (LY17F020031); National Natural Science Foundation of China (61702458); Science & Technology Program of Guangdong Province (2015A050502006); Science & Technology Program of Shenzhen City (GJHZ20150316112419786); Science & Technology Program of Zhejiang Province (2015C03001); Collaborative Innovation Center for Garment Personalized Customization of Zhejiang Province (浙教高科[2016]63号); Startup Foundation of ZSTU (15032166-Y)

  • Article
    • | |
  • Metrics
    • |
  • Reference
    • |
  • Related
    • |
  • Cited by
    • | |
  • Comments
    Abstract:

    Traditional geodesic-based Poison merging method requires time-consuming computation of rotational and scale fields, which restricts its interactive applications. This study proposed an efficient mesh merging method with reusable Laplacian operator. The method reduces problems of geometry merging, interpolation of rotational and scale fields into solving linear equations with the same Laplace matrix. It obtains eight scalar fields used in merging step by conducting Cholesky decomposition once and back substitutions several times, which is two orders of magnitude faster than the traditional geodesic-based method. To optimize the mesh nearby the merging boundary, it uses a robust method based on constrained Delaunay triangulation and discrete minimal surface. Meanwhile, it adopts reusable Laplacian operator again to merge the texture coordinates along with the geometry merging. The proposed method can handle models with complex topology and multiple boundaries, and the results are comparable to the traditional Poisson method but with much less time cost. The advantages make it capable of meeting the requirements of interactive response.

    Reference
    Related
    Cited by
Get Citation

金耀,熊宇龙,周泳全,张华熊,何利力.复用拉普拉斯算子的高效网格融合方法.软件学报,2019,30(12):3862-3875

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:December 06,2017
  • Revised:March 08,2018
  • Online: December 05,2019
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063