Sciweavers

257 search results - page 7 / 52
» The convexity spectra of graphs
Sort
View
ICIP
2004
IEEE
14 years 9 months ago
A set theoretic approach to target detection using spectral signature statistics
Pixels in hyperspectral images usually contain spectra from several classifiable objects, so that the recorded pixel is a mixture of the classes. Current methods estimate the prop...
David M. Rouse, H. Joel Trussell
ICRA
2005
IEEE
124views Robotics» more  ICRA 2005»
14 years 1 months ago
Sensor-based Planning for Planar Multi-Convex Rigid Bodies
— This paper presents a method for a planar rigid body consisting of multiple convex bodies to explore an unknown planar workspace, i.e., an unknown configuration space diffeomo...
Ji Yeong Lee, Howie Choset
GD
2009
Springer
13 years 10 months ago
Complexity of Some Geometric and Topological Problems
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
Marcus Schaefer
COMPGEOM
2011
ACM
12 years 11 months ago
Integer representations of convex polygon intersection graphs
Abstract. We study the grid size that is needed to represent intersection graphs of convex polygons. Here the polygons are similar to a base polygon P whose corners have rational c...
Tobias Müller, Erik Jan van Leeuwen, Jan van ...
CCCG
2007
13 years 9 months ago
Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs
The empty space around n disjoint line segments in the plane can be partitioned into n + 1 convex faces by extending the segments in some order. The dual graph of such a partition...
Nadia Benbernou, Erik D. Demaine, Martin L. Demain...