137 search results - page 9 / 28 » On polygons excluding point sets |
COMPGEOM
2004
ACM
14 years 24 days ago
2004
ACM
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...
SMI
2005
IEEE
14 years 28 days ago
2005
IEEE
Point-based surfaces (i.e. surfaces represented by discrete point sets which are either directly obtained by current 3D acquisition devices or converted from other surface represe...
COR
2006
13 years 7 months ago
2006
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at tw...
IWPEC
2004
Springer
14 years 21 days ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
CAGD
2010
13 years 4 months ago
2010
We present an exact algorithm for computing the precise Hausdorff distance between two general polyhedra represented as triangular meshes. The locus of candidate points, events wh...