Sciweavers

401 search results - page 9 / 81
» Algorithms for a Simple Point Placement Problem
Sort
View
IWPEC
2004
Springer
14 years 22 days ago
The Minimum Weight Triangulation Problem with Few Inner Points
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
Michael Hoffmann, Yoshio Okamoto
SECON
2010
IEEE
13 years 5 months ago
Placement and Orientation of Rotating Directional Sensors
In this paper, we address several problems that arise in the context of rotating directional sensors. Rotating directional sensors (RDS) have a "directional" coverage reg...
Giordano Fusco, Himanshu Gupta
MEMICS
2010
13 years 2 months ago
A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
Ondrej Danek, Martin Maska
JPDC
2008
161views more  JPDC 2008»
13 years 7 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
ALGORITHMICA
1998
111views more  ALGORITHMICA 1998»
13 years 7 months ago
A Note on Point Location in Delaunay Triangulations of Random Points
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...
Luc Devroye, Ernst P. Mücke, Binhai Zhu