417 search results - page 2 / 84 » Convex Shape Decomposition |
211
Voted
SCALESPACE
2009
Springer
16 years 2 months ago
2009
Springer
In this paper a framework for defining scale-spaces, based on the computational geometry concepts of α-shapes, is proposed. In this approach, objects (curves or surfaces) of incr...
165
Voted
VMV
2008
15 years 9 months ago
2008
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
238
click to vote
ICIP
2004
IEEE
16 years 9 months ago
2004
IEEE
This paper describes a computational model for deriving a decomposition of objects from laser rangefinder data. The process aims to produce a set of parts defined by compactness a...
175
Voted
COMPGEOM
2004
ACM
16 years 29 days ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
254
Voted
INFOCOM
2012
IEEE
13 years 10 months ago
2012
IEEE
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...