Sciweavers

266 search results - page 10 / 54
» On the variance of random polygons
Sort
View
ICPR
2004
IEEE
16 years 23 days ago
Pattern Matching by Sequential Subdivision of Transformation Space
Pattern matching is a well-known pattern recognition technique. This paper proposes a novel pattern matching algorithm that searches transformation space by sequential subdivision...
Mingtian Ni, Stephen E. Reichenbach
IJRR
2007
60views more  IJRR 2007»
14 years 11 months ago
Randomized Algorithms for Minimum Distance Localization
We address the problem of minimum distance localization in environments that may contain self-similarities. A mobile robot is placed at an unknown location inside a ¢¤£ self-sim...
Malvika Rao, Gregory Dudek, Sue Whitesides
DCG
1999
81views more  DCG 1999»
14 years 11 months ago
Properties of Random Triangulations and Trees
Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric" features of a triangulation Tn, fo...
Luc Devroye, Philippe Flajolet, Ferran Hurtado, Ma...
ALGORITHMICA
2007
165views more  ALGORITHMICA 2007»
14 years 11 months ago
Motorcycle Graphs and Straight Skeletons
We present a new algorithm to compute motorcycle graphs. It runs in O(n √ n log n) time when n is the number of motorcycles. We give a new characterization of the straight skele...
Siu-Wing Cheng, Antoine Vigneron
105
Voted
VMV
2001
108views Visualization» more  VMV 2001»
15 years 1 months ago
A Theoretical Comparison of Monte Carlo Radiosity Algorithms
In this paper, we present a theoretical analysis of the error with three basic Monte Carlo radiosity algorithms, based on continuous collision shooting random walks, discrete coll...
Philippe Bekaert, Hans-Peter Seidel