2877 search results - page 14 / 576 » The Complexity of Planarity Testing |
VIIP
2001
13 years 9 months ago
2001
Closed streamlines are an integral part of vector field topology, since they behave like sources respectively sinks but are often neither considered nor detected. If a streamline ...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
ICPR
2000
IEEE
14 years 8 months ago
2000
IEEE
We present a very simple and effective method for eliminating the degeneracy inherent in a planar scene, and demonstrate its performance in a useful application -- that of binocul...
GMP
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract. This paper presents an algorithm to generate a smooth surface between two closed spatial spline curves. With the assumption that the two input curves can be projected to ...
DLT
2009
13 years 5 months ago
2009
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...