Computing Smooth Quasi-geodesic Distance Field (QGDF) with Quadratic Programming-Reference-Cited by-同舟云学术

Computing Smooth Quasi-geodesic Distance Field (QGDF) with Quadratic Programming

Author:

Cao Luming,Zhao Junhao,Xu Jian,Chen Shuangmin,Liu Guozhu,Xin Shiqing,Zhou Yuanfeng,He Ying

Funder

National Natural Science Foundation of China

NSFC-Zhejiang Joint Fund for the Integration of Industrialization and Informatization

Dalian University of Technology

National Young Talents Program of China

Chinese Academy of Science

Publisher

Elsevier BV

Subject

Industrial and Manufacturing Engineering,Computer Graphics and Computer-Aided Design,Computer Science Applications

Reference36 articles.

1. Texture mapping via spherical multi-dimensional scaling;Elad,2005

2. Farthest-point optimized point sets with maximized minimum distance;Schlömer,2011

3. Shape by example;Sloan,2001

4. Geodesic shape retrieval via optimal mass transport;Rabin,2010

5. Non-rigid shape correspondence and description using geodesic field estimate distribution;New,2012

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. A Convex Optimization Framework for Regularized Geodesic Distances;Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Proceedings;2023-07-23

3. Modified Heat Method using GMRES for Geodesic Distance;2022 IEEE Conference on Interdisciplinary Approaches in Technology and Management for Social Innovation (IATMSI);2022-12-21

4. Enhanced Heat Method for Computation of Geodesic Distance on Triangular Meshes;2022 IEEE 9th Uttar Pradesh Section International Conference on Electrical, Electronics and Computer Engineering (UPCON);2022-12-02