Sciweavers

21 search results - page 2 / 5
» On point covers of c-oriented polygons
Sort
View
CGF
2006
125views more  CGF 2006»
13 years 6 months ago
Translational Covering of Closed Planar Cubic B-Spline Curves
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
Cristina Neacsu, Karen Daniels
JPDC
2008
161views more  JPDC 2008»
13 years 6 months ago
Base station placement on boundary of a convex polygon
Let P be a polygonal region which is forbidden for placing a base station in the context of mobile communication. Our objective is to place one base station at any point on the bo...
Sasanka Roy, Debabrata Bardhan, Sandip Das
CCCG
2007
13 years 7 months ago
Generalized Watchman Route Problem with Discrete View Cost
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta
CORR
2002
Springer
93views Education» more  CORR 2002»
13 years 6 months ago
On the Reflexivity of Point Sets
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity (S) of S is given by the smallest numb...
Esther M. Arkin, Sándor P. Fekete, Ferran H...
CCCG
2010
13 years 7 months ago
On the variance of random polygons
A random polygon is the convex hull of uniformly distributed random points in a convex body K R2 . General upper bounds are established for the variance of the area of a random p...
William L. Steiger, Imre Bárány