Fast algorithms for computing self-avoiding walks and mesh intersections over unstructured meshes
type: Item
instance of: scholarly article
title: Fast algorithms for computing self-avoiding walks and mesh intersections over unstructured meshes
zbMATH Open document ID: 1074.68666
author: Chih-Hsueh Yang
author: Jeng-Renn Yang
author: Pei-Zong Lee
published in: Advances in Engineering Software
publication date: 2004-09-23T00:00:00Z
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 2102527
MaRDI profile type: Publication
full work available at URL: j.advengsoft.2003.11.001
OpenAlex ID: W1969979249
DOI: 10.1016/J.ADVENGSOFT.2003.11.001
Recommended article: Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons
Recommended article: A faster implementation of the pivot algorithm for self-avoiding walks
Recommended article: Efficient implementation of the Pivot algorithm for self-avoiding walks
Recommended article: Q4779175
Recommended article: An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension
Recommended article: Self-intersections elimination for unstructured surface computational meshes
Recommended article: Cut-and-permute algorithm for self-avoiding walks in the presence of surfaces
Recommended article: An efficient algorithm for constructing Hamiltonian paths in meshes
Recommended article: Simulating self-avoiding walks in bounded domains
description: scientific article; zbMATH DE number 2102527