Sciweavers

346 search results - page 12 / 70
» Isodiametric Problems for Polygons
Sort
View
IJCGA
2010
99views more  IJCGA 2010»
13 years 5 months ago
Finding All Door Locations that Make a Room Searchable
—A room is a simple polygon with a prespecified point, called the door, on its boundary. Search may be conducted by two guards on the boundary who keep mutual visibility at all ...
Tsunehiko Kameda, John Z. Zhang
SIAMSC
2010
144views more  SIAMSC 2010»
13 years 5 months ago
An Exponentially Convergent Nonpolynomial Finite Element Method for Time-Harmonic Scattering from Polygons
In recent years nonpolynomial finite element methods have received increasing attention for the efficient solution of wave problems. As with their close cousin the method of parti...
A. H. Barnett, Timo Betcke
IWPEC
2004
Springer
14 years 22 days ago
The Minimum Weight Triangulation Problem with Few Inner Points
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
Michael Hoffmann, Yoshio Okamoto
EJC
2008
13 years 7 months ago
Some existence and construction results of polygonal designs
This paper revisits the existence and construction problems for polygonal designs (a special class of partially balanced incomplete block designs associated with regular polygons)...
Gargi Bhattacharyya, John Hegeman, Joohyung Kim, J...
DM
2010
135views more  DM 2010»
13 years 7 months ago
On convexification of polygons by pops
Given a polygon P in the plane, a pop operation is the reflection of a vertex with respect to the line through its adjacent vertices. We define a family of alternating polygons, a...
Adrian Dumitrescu, Evan Hilscher