279 search results - page 16 / 56 » Implicit Convex Polygons |
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
In this work, we introduce a novel implicit representation of shape which is based on assigning to each pixel a probability that this pixel is inside the shape. This probabilistic...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...
IROS
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper formalizes and proposes an algorithm to compute coverage diameters of polygons in 2D. Roughly speaking, the coverage diameter of a polygon is the longest possible di...
COMGEO
2000
ACM
13 years 7 months ago
2000
ACM
This paper presents the Hierarchical Walk, or H-Walk algorithm, which maintains the distance between two moving convex bodies by exploiting both motion coherence and hierarchical ...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the ...