Sciweavers

346 search results - page 40 / 70
» Isodiametric Problems for Polygons
Sort
View
ESA
1999
Springer
110views Algorithms» more  ESA 1999»
14 years 2 months ago
Geometric Searching over the Rationals
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...
Bernard Chazelle
IJRR
2007
60views more  IJRR 2007»
13 years 9 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
FSTTCS
2006
Springer
14 years 1 months ago
Multi-stack Boundary Labeling Problems
The boundary labeling problem was recently introduced in [5] as a response to the problem of labeling dense point sets with large labels. In boundary labeling, we are given a recta...
Michael A. Bekos, Michael Kaufmann, Katerina Potik...
AHSWN
2006
148views more  AHSWN 2006»
13 years 10 months ago
Geometric Chemotaxis: A Biologically-Inspired Framework for a Class of Wireless Coverage Problems
Abstract-- We present a new, biologically-inspired algorithm for the problem of covering a given region with wireless "units" (sensors or base-stations). The general prob...
Hidayet Ozgur Sanli, Rahul Simha, Bhagirath Naraha...
ICRA
2005
IEEE
118views Robotics» more  ICRA 2005»
14 years 3 months ago
Planning for Steerable Bevel-tip Needle Insertion Through 2D Soft Tissue with Obstacles
— We explore motion planning for a new class of highly flexible bevel-tip medical needles that can be steered to previously unreachable targets in soft tissue. Planning for thes...
Ron Alterovitz, Kenneth Y. Goldberg, Allison M. Ok...