#### Filter Results:

- Full text PDF available (19)

#### Publication Year

2002

2015

- This year (0)
- Last 5 years (4)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ana Paula Tomás, António Leslie Bajuelos, Fábio Marques
- ISAIM
- 2006

We address the problem of stationing guards in vertices of a simple polygon in such a way that the whole polygon is guarded and the number of guards is minimum. It is known that this is an NP-hard Art Gallery Problem with relevant practical applications. In this paper we present an approximation method that solves the problem by successive approximations,… (More)

- ANTONIO L. BAJUELOS, SANTIAGO CANALES, +5 authors Ana Mafalda Martins
- 2008

The problem of minimizing the number of vertex-guards necessary to cover a given simple polygon (MINIMUM VERTEX GUARD (MVG) problem) is NP-hard. This computational complexity opens two lines of investigation: the development of algorithms that establish approximate solutions and the determination of optimal solutions for special classes of simple polygons.… (More)

In this paper we present a methodology for describing adaptive educational-game environments and a model that supports the environment design process. These environments combine the advantages of educational games with those derived from the adaptation. The proposed methodology allows the specification of educational methods that can be used for the game… (More)

- Ana Paula Tomás, António Leslie Bajuelos, Fábio Marques
- International Conference on Computational Science
- 2003

We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may be directly extended to terrains along the lines of [4]. A major idea in our approach is to explore dominance of visibility regions to first detect pieces that are more difficult… (More)

- Ana Paula Tomás, António Leslie Bajuelos
- CAEPIA
- 2003

We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a technique we developed to obtain polygons with an increasing number of vertices starting from a unit square. The other follows a constraint programming approach and gives great control on the… (More)

- António Leslie Bajuelos, Ana Paula Tomás, Fábio Marques
- ICCSA
- 2004

- Ana Paula Tomás, António Leslie Bajuelos
- ICCSA
- 2004

We propose Inflate-Paste – a new technique for generating orthogonal polygons with a given number of vertices from a unit square based on gluing rectangles. It is dual to Inflate-Cut – a technique we introduced in [12] that works by cutting rectangles.

The MIR Voronoi diagram appears with the notion of good illumination introduced in [3, 4]. This illumination concept generalizes well-covering [7] and triangle guarding [9]. The MIR Voronoi diagram merges the notions of proximity and convex dependency. Given a set S of planar light sources, for each point q in the plane we search for the subset Sq ⊂ S… (More)

- Manuel Abellanas, António Leslie Bajuelos, Inês Matos
- ICCSA
- 2007

A point p is 1-well illuminated by a set of n point lights if there is, at least, one light interior to each half-plane with p on its border. We consider the illumination range of the lights as a parameter to be optimized. So we minimize the lights’ illumination range to 1-well illuminate a given point p. We also present two generalizations of 1-good… (More)

In this paper we focus on approximate solutions to solve a new class of Art Gallery Problems inspired by wireless localization. Instead of the usual guards we consider wireless devices whose signal can cross a certain number, k, of walls. These devices are called k-transmitters. We propose an algorithm for constructing the visibility region of a… (More)