We give faster algorithms for two methods of reducing the number of states in nondeterministic finite automata. The first uses equivalences and the second uses preorders. We deve...
Abstract. The expressiveness of a lot of image analysis algorithms depends on the question whether shape information is preserved during digitization. Most existing approaches to a...
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
We developed a method that transforms a polygonal representation of an object into a voxel representation on a 3D regular grid. By applying scale-space theory we derived expression...
Sketching interface, as a user-friendly means for expression and communication, is not only an important medium for inputting 3D objects, but also a significant step of visualizing...