67 search results - page 3 / 14 » Approximate convex decomposition of polygons |
86
Voted
MVA
2007
14 years 11 months ago
2007
This paper presents a new approach to extracting and representing structural features of images. The approach is based on both a region-based analysis and a contour-based analysis...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opa...
90
Voted
CGI
2003
IEEE
15 years 2 months ago
2003
IEEE
A hardware polygon rendering pipeline can be used together with hardware compositing to volume-render arbitrary unstructured grids composed of convex polyhedral cells. This techni...
97
Voted
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
149
click to vote
INFOCOM
2012
IEEE
12 years 12 months ago
2012
IEEE
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...