22 search results - page 1 / 5 » Stabbing Convex Polygons with a Segment or a Polygon |
ESA
2008
Springer
13 years 10 months ago
2008
Springer
Let O = {O1, . . . , Om} be a set of m convex polygons in R2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without refle...
MVA
2007
13 years 10 months ago
2007
This paper presents a new approach to extracting and representing structural features of images. The approach is based on both a region-based analysis and a contour-based analysis...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We show that cutting shortest paths from every vertex of a convex polyhedron to a simple closed quasigeodesic, and cutting all but a short segment of the quasigeodesic, unfolds th...
JGAA
2008
13 years 8 months ago
2008
In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection and all facial cycles are drawn as convex polygons. In a convex gr...
DCG
2002
13 years 8 months ago
2002
Let f(n) be the maximum number of unit distances determined by the vertices of a convex n-gon. Erdos and Moser conjectured that this function is linear. Supporting this conjecture...