COMPUTING CONVEX HULLS BY AUTOMATA ITERATION

DOI10.1142/S0129054109006796zbMATH Open1194.68134OpenAlexW2023900553MaRDI QIDQ3395136FDOQ3395136

François Cantin, Pierre Wolper, Axel Legay

Publication date: 21 August 2009

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054109006796

Recommendations

• Computing Convex Hulls by Automata Iteration
• Convex Hull of Arithmetic Automata
• scientific article; zbMATH DE number 1182912
• Extended convex hull
• The quickhull algorithm for convex hulls

zbMATH Keywords

convex hullBüchi automata(\(\omega \)-)regular model checking

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• An optimal convex hull algorithm in any fixed dimension
• Alternating finite automata on \(\omega\)-words
• Efficient minimization of deterministic weak \(\omega\)-automata
• An effective decision procedure for linear arithmetic over the integers and reals
• The convex hull of a regular set of integer vectors is polyhedral and effectively computable

Cited In (7)

• Computing convex hulls with a linear solver
• Neuro-convex-hull computation from a set of circles
• Convex Hull of Arithmetic Automata
• Using interval arithmetic for determining the structure of convex hulls
• An exact and optimal local solution to the two-dimensional convex hull of arbitrary points problem
• An improved cellular automata based algorithm for the 45-convex hull problem
• Computing Convex Hulls by Automata Iteration

This page was built for publication: COMPUTING CONVEX HULLS BY AUTOMATA ITERATION

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