COMPUTING CONVEX HULLS BY AUTOMATA ITERATION
From MaRDI portal
Publication:3395136
DOI10.1142/S0129054109006796zbMATH Open1194.68134OpenAlexW2023900553MaRDI QIDQ3395136FDOQ3395136
Authors: François Cantin, Axel Legay, Pierre Wolper 
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
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 (13)
- 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
- The affine hull of a binary automaton is computable in polynomial time
- Computability of convex sets
- The convex hull of a regular set of integer vectors is polyhedral and effectively computable
- An exact and optimal local solution to the two-dimensional convex hull of arbitrary points problem
- The convex hull of finitely generable subsets and its predicate transformer
- An improved cellular automata based algorithm for the 45-convex hull problem
- Boundary modeling in model-based calibration for automotive engines via the vertex representation of the convex hulls
- Computing Convex Hulls by Automata Iteration
- Convex hulls on cellular automata
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)
