2877 search results - page 5 / 576 » The Complexity of Planarity Testing |
DGCI
2009
Springer
13 years 4 months ago
2009
Springer
The test mask TM is the minimum neighbourhood sufficient to extract the medial axis of any discrete shape, for a given chamfer distance mask M. We propose an arithmetical framework...
DCG
2010
13 years 4 months ago
2010
Fix a finite set of points in Euclidean n-space En , thought of as a point-cloud sampling of a certain domain D En . The VietorisRips complex is a combinatorial simplicial complex...
IROS
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract— In this paper we present an experimental evaluation of automatic robotic assembly of complex planar parts. The torque-controlled DLR light-weight robot, equipped with a...
ISAAC
2004
Springer
14 years 9 days ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
GD
2007
Springer
14 years 1 months ago
2007
Springer
