Sciweavers

732 search results - page 15 / 147
» Testing Geometric Convexity
Sort
View
GC
2007
Springer
13 years 7 months ago
Gray Code Enumeration of Plane Straight-Line Graphs
We develop Gray code enumeration schemes for geometric graphs in the plane. The considered graph classes include plane straight-line graphs, plane spanning trees, and connected pl...
Oswin Aichholzer, Franz Aurenhammer, Clemens Hueme...
CCCG
2003
13 years 9 months ago
An algorithm for the MaxMin area triangulation of a convex polygon
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon...
J. Mark Keil, Tzvetalin S. Vassilev
SIAMIS
2008
124views more  SIAMIS 2008»
13 years 7 months ago
Area Distances of Convex Plane Curves and Improper Affine Spheres
The area distance to a convex plane curve is an important concept in computer vision. In this paper we describe a strong link between area distances and improper affine spheres. Th...
Marcos Craizer, Moacyr Alvim, Ralph Teixeira
CVPR
2010
IEEE
14 years 3 months ago
Convex Shape Decomposition
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
Liu Hairong, Longin Jan Latecki, Liu Wenyu
SODA
1996
ACM
121views Algorithms» more  SODA 1996»
13 years 9 months ago
Optimal Placement of Convex Polygons to Maximize Point Containment
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
Matthew Dickerson, Daniel Scharstein