Sciweavers

131 search results - page 2 / 27
» On the Maximum Number of Translates in a Point Set
Sort
View
CORR
2008
Springer
151views Education» more  CORR 2008»
13 years 7 months ago
Geometric Set Cover and Hitting Sets for Polytopes in $R^3$
Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...
Sören Laue
COMPGEOM
2006
ACM
14 years 1 months ago
Random triangulations of planar point sets
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
Micha Sharir, Emo Welzl
JCT
2011
108views more  JCT 2011»
13 years 2 months ago
The number of extreme points of tropical polyhedra
The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define...
Xavier Allamigeon, Stéphane Gaubert, Ricard...
TASE
2010
IEEE
13 years 2 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
CCCG
2009
13 years 8 months ago
Optimal Empty Pseudo-Triangles in a Point Set
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 ...
Hee-Kap Ahn, Sang Won Bae, Iris Reinbacher