An improved cellular automata based algorithm for the 45-convex hull problem

MaRDI QIDQ3654092zbMATH OpenFDO

Authors Adam Clarridge, Kai Salomaa

Publication date 4 January 2010

zbMATH Keywords

cellular automaton algorithm

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Cellular automata (computational aspects) (68Q80) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Convex hulls on cellular automata
• An exact and optimal local solution to the two-dimensional convex hull of arbitrary points problem
• COMPUTING CONVEX HULLS BY AUTOMATA ITERATION
• Convex hulls and metric Gabriel graphs
• Computing Convex Hulls by Automata Iteration

Cited in

(3)

• Convex hulls and metric Gabriel graphs
• An exact and optimal local solution to the two-dimensional convex hull of arbitrary points problem
• Convex hulls on cellular automata

This page was built for publication: An improved cellular automata based algorithm for the 45-convex hull problem

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