COMPUTING CONVEX HULLS BY AUTOMATA ITERATION
From MaRDI portal
Publication:3395136
Recommendations
Cites work
- Alternating finite automata on \(\omega\)-words
- An effective decision procedure for linear arithmetic over the integers and reals
- An optimal convex hull algorithm in any fixed dimension
- Efficient minimization of deterministic weak \(\omega\)-automata
- The convex hull of a regular set of integer vectors is polyhedral and effectively computable
Cited in
(13)- 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
- The affine hull of a binary automaton is computable in polynomial time
- Convex hulls on cellular automata
- The convex hull of a regular set of integer vectors is polyhedral and effectively computable
- Computing Convex Hulls by Automata Iteration
- Neuro-convex-hull computation from a set of circles
- Convex Hull of Arithmetic Automata
- Computing convex hulls with a linear solver
- Computability of convex sets
- Using interval arithmetic for determining the structure of convex hulls
- Boundary modeling in model-based calibration for automotive engines via the vertex representation of the convex hulls
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)