Sciweavers

346 search results - page 24 / 70
» Isodiametric Problems for Polygons
Sort
View
CCCG
2006
13 years 10 months ago
An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
Asish Mukhopadhyay, Robert L. Scot Drysdale
SIAMNUM
2010
127views more  SIAMNUM 2010»
13 years 3 months ago
The Discrete Duality Finite Volume Method for Convection-diffusion Problems
In this paper we extend the discrete duality finite volume (DDFV) formulation to the steady convection-diffusion equation. The discrete gradients defined in DDFV are used to define...
Yves Coudière, Gianmarco Manzini
ICCSA
2003
Springer
14 years 1 months ago
Web Visualization of Function-Defined Shapes
Abstract. This paper describes how function-based shape modeling can be expanded to web visualization, as well as how web-based visualization can be greatly improved by using the f...
Alexei Sourin, Lai Feng Min, Konstantin Levinski
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
14 years 8 months ago
Sublinear geometric algorithms
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
Bernard Chazelle, Ding Liu, Avner Magen
ICRA
2006
IEEE
61views Robotics» more  ICRA 2006»
14 years 2 months ago
Global Localization using Odometry
— This paper presents a global localization technique for a robot with only linear and angular odometers. The robot, whose configuration is composed of its position and orientat...
Jason M. O'Kane