Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Hi-index | 0.10 |
A construction is given for associating a finite state automaton with a 3-dimensional polyhedron. It has the property that if a polyhedral segment is encoded as a string and used as input to the automaton, the automaton state which is reached contains information about all congruences of the segment with parts of the polyhedral surface. An application is retrieval from a polyhedral database, given as key a partial 3D view.