Computing Convex Hulls by Automata Iteration

DOI10.1007/978-3-540-70844-5_12zbMATH Open1172.68496OpenAlexW2128275704MaRDI QIDQ3602806FDOQ3602806

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

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

Mathematics Subject Classification ID

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

Cited In (10)

• Computing convex hulls with a linear solver
• Convex Hull of Arithmetic Automata
• The affine hull of a binary automaton is computable in polynomial time
• The convex hull of a regular set of integer vectors is polyhedral and effectively computable
• The convex hull of finitely generable subsets and its predicate transformer
• An improved cellular automata based algorithm for the 45-convex hull problem
• COMPUTING CONVEX HULLS BY AUTOMATA ITERATION
• Boundary modeling in model-based calibration for automotive engines via the vertex representation of the convex hulls
• Convex hulls on cellular automata
• Implementation and Application of 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 Q3602806)