732 search results - page 21 / 147 » Testing Geometric Convexity |
CCCG
1993
13 years 9 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
We propose a unified framework based on a general definition of geometric transform (GeT) for modeling appearance. GeT represents the appearance by applying designed functionals o...
SIP
2003
13 years 9 months ago
2003
This paper presents a data-driven approach for segmenting range data to enable a humanoid robot to perform interactive domestic tasks. Range data is segmented into geometric primi...
WSCG
2004
13 years 9 months ago
2004
We present a real-time algorithm for rendering volumetric 3D Magic LensesTM having arbitrary convex shapes. During fragment processing the algorithm performs a second depth test u...