Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/144745
Title: DE-path : a differential-evolution-based method for computing energy-minimizing paths on surfaces
Authors: Ye, Zipeng
Liu, Yong-Jin
Zheng, Jianmin
Hormann, Kai
He, Ying
Keywords: Engineering::Computer science and engineering
Issue Date: 2019
Source: Ye, Z., Liu, Y.-J., Zheng, J., Hormann, K., & He, Y. (2019). DE-path : a differential-evolution-based method for computing energy-minimizing paths on surfaces. Computer-Aided Design, 114, 73-81. doi:10.1016/j.cad.2019.05.025
Project: MoE 2017-T2-1-076
RG26/17
Journal: Computer-Aided Design
Abstract: Computing energy-minimizing paths that are general for different energy forms is a common task in science and engineering. Conventional methods adopt numerical solvers, such as conjugate gradient or quasi-Newton. While these are efficient, the results are highly sensitive with respect to the initial paths. In this paper we develop a method based on differential evolution (DE) for computing optimal solutions. We propose a simple strategy to encode paths and define path operations, such as addition and scalar multiplication, so that the discrete paths can fit into the DE framework. We demonstrate the effectiveness of our method on three applications: (1) computing discrete geodesic paths on surfaces with non-uniform density function; (2) finding a smooth path that follows a given vector field as much as possible; and (3) finding a curve on a terrain with (near-) constant slope.
URI: https://hdl.handle.net/10356/144745
ISSN: 0010-4485
DOI: 10.1016/j.cad.2019.05.025
Schools: School of Computer Science and Engineering 
Rights: © 2019 Elsevier Ltd. All rights reserved.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SCSE Journal Articles

SCOPUSTM   
Citations 50

5
Updated on May 25, 2023

Web of ScienceTM
Citations 50

4
Updated on May 25, 2023

Page view(s)

199
Updated on Jun 1, 2023

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.