António Leslie Bajuelos

Learn 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)
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)
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)
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)
A grid n-ogon is a n-vertex orthogonal polygon that may be placed in a n 2 × n 2 unit square grid and that does not have collinear edges. Given a grid n-ogon P , let |Π(P)| be the number of rectangles that results when we partition P by extending the edges incident to reflex vertices towards its interior. P is called Fat if |Π(P)| is maximal for all grid(More)