Sciweavers

266 search results - page 1 / 54
» On the variance of random polygons
Sort
View
CCCG
2010
13 years 6 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
CAEPIA
2003
Springer
13 years 10 months ago
Generating Random Orthogonal Polygons
Abstract. We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a t...
Ana Paula Tomás, António Leslie Baju...
JUCS
2007
137views more  JUCS 2007»
13 years 4 months ago
An Approach to Polygonal Approximation of Digital Curves Based on Discrete Particle Swarm Algorithm
: An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the poly...
Fangmin Dong, Renbin Xiao, Yifang Zhong, Yong Liu
CORR
2007
Springer
79views Education» more  CORR 2007»
13 years 4 months ago
Connecting Polygonizations via Stretches and Twangs
We show that the space of polygonizations of a fixed planar point set S of n points is connected by O(n2 ) “moves” between simple polygons. Each move is composed of a sequence...
Mirela Damian, Robin Y. Flatland, Joseph O'Rourke,...
ICRA
2003
IEEE
103views Robotics» more  ICRA 2003»
13 years 10 months ago
On addressing the run-cost variance in randomized motion planners
The decades of research in motion planning have resulted in numerous algorithms. Many of the most successful algorithms are randomized and can have widely differing run-times for ...
Pekka Isto, Martti Mäntylä, Juha O. Tuom...