Computing Convex Hulls by Automata Iteration

DOI10.1007/978-3-540-70844-5_12MaRDI QIDQ3602806zbMATH OpenOpenAlexFDO

Authors François Cantin, Axel Legay, Pierre Wolper

Publication date 12 February 2009

Published in Implementation and Applications of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70844-5_12

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• COMPUTING CONVEX HULLS BY AUTOMATA ITERATION
• Convex Hull of Arithmetic Automata
• Extended convex hull
• scientific article; zbMATH DE number 1182912
• The convex hull of a regular set of integer vectors is polyhedral and effectively computable

Cited in

(10)

• 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
• Implementation and Application of Automata
• COMPUTING CONVEX HULLS BY AUTOMATA ITERATION
• Convex Hull of Arithmetic Automata
• Computing convex hulls with a linear solver
• 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 Q3602806)