A robust backward search method based on walk-through for point location on a 3D surface mesh

DOI10.1002/NME.2098zbMATH Open1162.65319OpenAlexW2163370733MaRDI QIDQ3623151FDOQ3623151

Authors:

Publication date: 16 April 2009

Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nme.2098

Recommendations

• The stochastic walk algorithms for point location in pseudo-triangulations
• A fast algorithm for point-location in a finite element mesh
• scientific article; zbMATH DE number 5239201
• scientific article; zbMATH DE number 4211552
• Towards an optimal method for dynamic planar point location
• On Point Location and Motion Planning among Simplices
• On point location and motion planning among simplices
• scientific article; zbMATH DE number 1487777

zbMATH Keywords

numerical examplescomputational geometrypoint locationbackward searchbarycentric coordinates searchcounter clockwise wise searchwalk-through

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cited In (5)

• Automatic feature-preserving size field for three-dimensional mesh generation
• Title not available (Why is that?)
• Boundary layer mesh generation with fast collision detection
• Generation of boundary layer meshes by the enhanced jump-and-walk method with a fast collision detecting algorithm
• Automatic sizing functions for unstructured surface mesh generation

This page was built for publication: A robust backward search method based on walk-through for point location on a 3D surface mesh

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3623151)