Sciweavers

346 search results - page 21 / 70
» Isodiametric Problems for Polygons
Sort
View
SIAMDM
2010
123views more  SIAMDM 2010»
13 years 5 months ago
Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons
We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES (k) such that any set S of at least fES (k) points in general posit...
Oswin Aichholzer, Thomas Hackl, Clemens Huemer, Fe...
CCCG
2010
13 years 8 months ago
Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
Xiuxia Pan, Fajie Li, Reinhard Klette
CCCG
2007
13 years 8 months ago
Optimal Schedules for 2-guard Room Search
We consider the problem of searching a polygonal room with two guards starting at a specified door point. While maintaining mutual visibility and without crossing the door, the g...
Stephen Bahun, Anna Lubiw
SIAMCO
2010
153views more  SIAMCO 2010»
13 years 2 months ago
Optimal Control for an Elliptic System with Polygonal State Constraints
This work is devoted to stationary optimal control problems with polygonal constraints on the components of the state. Existence of Lagrange multipliers, of different regularity, i...
Karl Kunisch, Kewei Liang, Xiliang Lu
FAW
2008
Springer
127views Algorithms» more  FAW 2008»
13 years 9 months ago
Visiting a Polygon on the Optimal Way to a Query Point
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
Ramtin Khosravi, Mohammad Ghodsi