Sciweavers

121 search results - page 18 / 25
» A bound on the number of points of a plane curve
Sort
View
COMPGEOM
2003
ACM
14 years 19 days ago
Controlled perturbation for arrangements of circles
Given a collection C of circles in the plane, we wish to construct the arrangement A(C) (namely the subdivision of the plane into vertices, edges and faces induced by C) using fl...
Dan Halperin, Eran Leiserowitz
WINET
2008
86views more  WINET 2008»
13 years 7 months ago
Relay sensor placement in wireless sensor networks
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...
Xiuzhen Cheng, Ding-Zhu Du, Lusheng Wang, Baogang ...
ISAAC
2010
Springer
257views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Approximating Minimum Bending Energy Path in a Simple Corridor
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
Jinhui Xu, Lei Xu, Yulai Xie
FOCS
1999
IEEE
13 years 11 months ago
Taking a Walk in a Planar Arrangement
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
Sariel Har-Peled
CVPR
2008
IEEE
14 years 9 months ago
Characterizing the shadow space of camera-light pairs
We present a theoretical analysis for characterizing the shadows cast by a point light source given its relative position to the camera. In particular, we analyze the epipolar geo...
Daniel A. Vaquero, Matthew Turk, Ramesh Raskar, Ro...