Sciweavers

27 search results - page 3 / 6
» On distinct distances from a vertex of a convex polygon
Sort
View
COMPGEOM
2011
ACM
12 years 11 months ago
Deconstructing approximate offsets
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...
COMPGEOM
2009
ACM
14 years 1 months ago
Shooting permanent rays among disjoint polygons in the plane
We present a data structure for ray shooting-and-insertion in the free space among disjoint polygonal obstacles with a total of n vertices in the plane, where each ray starts at t...
Mashhood Ishaque, Bettina Speckmann, Csaba D. T&oa...
IOR
2008
85views more  IOR 2008»
13 years 7 months ago
Equity-Efficiency Bicriteria Location with Squared Euclidean Distances
A facility has to be located within a given region taking two criteria of equity and efficiency into account. Equity is sought by minimizing the inequality in the inhabitant-facil...
Yoshiaki Ohsawa, Naoya Ozaki, Frank Plastria
ALGOSENSORS
2008
Springer
13 years 9 months ago
Simple Robots in Polygonal Environments: A Hierarchy
With the current progress in robot technology and related areas, sophisticated moving and sensing capabilities are at hand to design robots capable of solving seemingly complex tas...
Jan Brunner, Matús Mihalák, Subhash ...
ICIP
2007
IEEE
14 years 9 months ago
A Multi-Camera Surveillance System that Estimates Quality-of-View Measurement
In this paper, we propose a multi-camera video surveillance system with automatic camera selection. A new confidence measure, Quality-Of-View (QOV), is defined to automatically ev...
Changsong Shen, Chris Zhang, Sidney Fels