2877 search results - page 54 / 576 » The Complexity of Planarity Testing |
JCDCG
2000
Springer
14 years 19 days ago
2000
Springer
We present a simple and practical data structure for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron, determine the volume...
SIGACT
2008
13 years 9 months ago
2008
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
ICIP
2000
IEEE
14 years 10 months ago
2000
IEEE
New rotationally invariant texture feature extraction methods are introduced that utilise the dual tree complex wavelet transform (DT-CWT). The complex wavelet transform is a new ...
PTS
2007
13 years 10 months ago
2007
The interrelationship between software faults and failures is quite intricate and obtaining a meaningful characterization of it would definitely help the testing community in decid...
EVOW
2004
Springer
14 years 2 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...