1055 search results - page 14 / 211 » Enumerations in computable structure theory |
TVCG
2012
11 years 10 months ago
2012
—The Morse-Smale complex is a useful topological data structure for the analysis and visualization of scalar data. This paper describes an algorithm that processes all mesh eleme...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
— In this paper a novel formalism to characterize contact states between an articulated polyhedral object and a polyhedral environment for the generation of the graph of feasible...
COMPGEOM
2010
ACM
14 years 2 days ago
2010
ACM
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
APAL
2006
13 years 7 months ago
2006
We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence c...
FOSSACS
2005
Springer
14 years 1 months ago
2005
Springer
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...