including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
The process of generating discrete surfaces in a volumetric representation, termed voxelization, is confronted with topological considerations as well as accuracy and efficiency r...
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
Existing array region representation techniques are sensitive to the complexity of array subscripts. In general, these techniques are very accurate and efficient for simple subscr...
Implementing a compiler for a language with nondeterministic features is known to be a difficult task. This paper presents two new functions setChoicePoint and fail that extend th...