39 search results - page 2 / 8 » Distinct Triangle Areas in a Planar Point Set |
CCCG
2007
13 years 7 months ago
2007
We analyze the minimum and maximum number of empty pseudo-triangles defined by any planar point set. We consider the cases where the three convex vertices are fixed and where th...
CCCG
2010
13 years 7 months ago
2010
Given a set S of n points in the plane and a fixed angle 0 < < , we show how to find all triangles of minimum area with angle that enclose S in O(n log n) time.
ICDE
2007
IEEE
14 years 7 months ago
2007
IEEE
Database search for images containing icons with specific mutual spatial relationships can be facilitated by an appropriately structured index. For the case of images containing s...
GC
2007
Springer
13 years 5 months ago
2007
Springer
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
CCCG
2009
13 years 6 months ago
2009
Given n points in the plane, we study three optimization problems of computing an empty pseudo-triangle: we consider minimizing the perimeter, maximizing the area, and minimizing ...