Sciweavers

115 search results - page 2 / 23
» Refolding planar polygons
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Can one hear the shape of a room: The 2-D polygonal case
We consider the problem of estimating room geometry from the acoustic room impulse response (RIR). Existing approaches addressing this problem exploit the knowledge of multiple RI...
Ivan Dokmanic, Yue M. Lu, Martin Vetterli
IJRA
2011
101views more  IJRA 2011»
13 years 2 months ago
Information Surfing for Radiation Map Building
We develop a control scheme for a group of mobile sensors to map radiation over a given planar polygonal region. The advantage of this methodology is that it provides quick situat...
R. Andres Cortez, Herbert G. Tanner, Ron Lumia, Ch...
CCCG
2003
13 years 8 months ago
Decomposing Polygons Into Diameter Bounded Components
A decomposition of a polygon P is a set of polygons whose geometric union is exactly P. We consider the problem of decomposing a polygon, which may contain holes, using subpolygon...
Chris Worman
LATIN
2010
Springer
14 years 2 months ago
Optimal Polygonal Representation of Planar Graphs
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of pl...
Emden R. Gansner, Yifan Hu, Michael Kaufmann, Step...
IVC
2007
98views more  IVC 2007»
13 years 7 months ago
Reversible vectorisation of 3D digital planar curves and applications
This paper tackles the problem of the computation of a planar polygonal curve from a digital planar curve, such that the digital data can be exactly retrieved from the polygonal c...
Isabelle Sivignon, Florent Dupont, Jean-Marc Chass...