104 search results - page 10 / 21 » Intersecting convex sets by rays |
SMA
2009
ACM
14 years 4 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
COMPGEOM
1991
ACM
14 years 1 months ago
1991
ACM
Given a set of points in the plane, a crossing family is a collection of line segments, each joining two of the points, such that any two line segments intersect internally. Two s...
CVPR
2010
IEEE
14 years 6 months ago
2010
IEEE
In this paper we introduce a new shape constraint for interactive image segmentation. It is an extension of Veksler's star-convexity prior, in two ways: from a single star to ...
GMP
2000
IEEE
14 years 2 months ago
2000
IEEE
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between...
DIAGRAMS
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Area-proportional Venn diagrams are a popular way of visualizing the relationships between data sets, where the set intersections have a specified numerical value. In th...