23 search results - page 3 / 5 » Minimum Area Convex Packing of Two Convex Polygons |
145
click to vote
CCCG
2010
15 years 7 months ago
2010
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
170
click to vote
ESA
2009
Springer
16 years 15 days ago
2009
Springer
Abstract. A mobile robot, represented by a point moving along a polygonal line in the plane, has to explore an unknown polygon and return to the starting point. The robot has a sen...
147
click to vote
CCCG
2009
15 years 7 months ago
2009
Given n points in the plane, we study three optimization problems of computing an empty pseudo-triangle: we consider minimizing the perimeter, maximizing the area, and minimizing ...
149
click to vote
SSDBM
2000
IEEE
15 years 10 months ago
2000
IEEE
Efficient evaluation of spatial join is an important issue in spatial databases. The traditional evaluation strategy is to perform a join of “minimum bounding rectangles” (mbr...
140
Voted
IOR
2008
15 years 6 months ago
2008
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...