Fast extremum graph computation for large-scale arbitrary grids

DOI10.1016/J.CAGD.2026.102519MaRDI QIDQ6847681zbMATH OpenFDO

Authors Quming Li, Zhengwen Liu, Zhibin Huang, Wan-Tong Li, Zhiqiang Chu, Zhitao Dai, Min Yu, Fang Deng

Publication date 9 March 2026

Published in Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.CAGD.2026.102519

zbMATH Keywords

gridMorse theoryextremum graph computation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Abstract critical point theory (Morse theory, Lyusternik-Shnirel'man theory, etc.) in infinite-dimensional spaces (58E05)

Cites work

• Computational topology. An introduction
• Efficient software for programmable visual analysis using Morse-Smale complexes
• Morse Theory. (AM-51)
• Morse theory for cell complexes
• Revisiting accurate geometry for Morse-Smale complexes
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• The calculus of variations in the large.

This page was built for publication: Fast extremum graph computation for large-scale arbitrary grids

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